检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

35 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

37 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

32 篇 工学
- 20 篇 建筑学
- 20 篇 土木工程
- 20 篇 测绘科学与技术
- 13 篇 计算机科学与技术...
- 8 篇 软件工程
- 1 篇 信息与通信工程
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
- 1 篇 生物工程
20 篇 理学
- 19 篇 数学
- 1 篇 生物学
3 篇 管理学
- 3 篇 管理科学与工程(可...
1 篇 农学
- 1 篇 作物学

主题

14 篇 drawing (graphic...
8 篇 visualization
6 篇 graph theory
1 篇 program debuggin...
1 篇 graph embeddings
1 篇 software enginee...
1 篇 large dataset
1 篇 computer appl. i...
1 篇 computer graphic...
1 篇 binary trees
1 篇 discrete mathema...
1 篇 directed graphs
1 篇 clustering algor...
1 篇 data structures
1 篇 algorithm analys...
1 篇 heuristic algori...

机构

3 篇 wilhelm-schickha...
3 篇 università degli...
2 篇 lg theoretische ...
2 篇 university of pe...
2 篇 lehrstuhl für in...
2 篇 roma tre univers...
2 篇 department of ma...
2 篇 department of co...
2 篇 univ wurzburg wu...
1 篇 tu eindhoven ein...
1 篇 national institu...
1 篇 univ waterloo wa...
1 篇 st petersburg st...
1 篇 universität tübi...
1 篇 institut für inf...
1 篇 univ politecn ca...
1 篇 agenzia entrate ...
1 篇 department of co...
1 篇 university of li...
1 篇 university of ca...

作者

5 篇 kaufmann michael
4 篇 liotta giuseppe
4 篇 montecchiani fab...
3 篇 kobourov stephen
3 篇 biedl therese
3 篇 mchedlidze tamar...
3 篇 hong seok-hee
3 篇 rutter ignaz
3 篇 didimo walter
3 篇 tappini alessand...
3 篇 wolff alexander
3 篇 kindermann phili...
2 篇 angelini patrizi...
2 篇 frati fabrizio
2 篇 eades peter
2 篇 chaplick steven
2 篇 radermacher marc...
2 篇 heinsohn niklas
2 篇 di giacomo emili...
2 篇 lipp fabian

语言

37 篇 英文

检索条件"任意字段=25th International Symposium on Graph Drawing and Network Visualization, GD 2017"

共 37 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

25th international symposium on graph drawing and network visualization, gd 2017

引用

25th international symposium on graph drawing and network visualization, gd 2017

ISBN: (纸本)9783319739144

the proceedings contain 44 papers. the special focus in this conference is on graph drawing and network visualization. the topics include: Arrangements of pseudocircles: Triangles and drawings;drawing bobbin lace graphs, or, fundamental cycles for a subclass of periodic graphs;many touchings force many crossings;thrackles: An improved upper bound;on smooth orthogonal and octilinear drawings: Relations, complexity and Kandinsky drawings;EPG-representations with small Grid-Size;mixed linear layouts of planar graphs;upward partitioned book embeddings;experimental evaluation of book drawing algorithms;on the edge-length ratio of outerplanar graphs;visual similarity perception of directed acyclic graphs: A study on influencing factors;giViP: A visual profiler for distributed graph processing systems;drawing big graphs using spectral sparsification;revisited experimental comparison of node-link and matrix representations;improved bounds for drawing trees on fixed points with L-Shaped edges;on upward drawings of trees on a given grid;simple compact monotone tree drawings;visualizing Co-phylogenetic reconciliations;anisotropic radial layout for visualizing centrality and structure in graphs;computing storyline visualizations with few block crossings;on vertex- and empty-ply proximity drawings;MLSEB: Edge bundling using moving least squares approximation;drawing dynamic graphs without timeslices;colored point-set embeddings of acyclic graphs;planar drawings of fixed-mobile bigraphs;ordered level planarity, geodesic planarity and Bi-Monotonicity;non-crossing paths with geographic constraints;planar L-drawings of directed graphs;nodeTrix planarity testing with small clusters;the painter’s problem: Covering a grid with colored connected polygons;triangle-free penny graphs: Degeneracy, Choosability, and edge count;1-fan-bundle-planar drawings of graphs;gap-planar graphs;beyond outerplanarity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

graph drawing Contest Report 25th

引用

26th international symposium on graph drawing and network visualization (gd)

作者： Devanny, William Kindermann, Philipp Loffler, Maarten Rutter, Ignaz Univ Calif Irvine Irvine CA USA Univ Wurzburg Wurzburg Germany Univ Utrecht Utrecht Netherlands Univ Passau Passau Germany

this report describes the 25th Annual graph drawing Contest, held in conjunction with the 26th international symposium on graph drawing and network visualization (gd'18) in Barcelona, Spain. the mission of the Gra... 详细信息

ISBN: (纸本)9783030044145;9783030044138

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

drawing big graphs using spectral sparsification 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Eades, Peter Nguyen, Quan Hong, Seok-Hee The School of Information Technologies University of Sydney Sydney Australia

ISBN: (纸本)9783319739144

Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties. We investigate the use of spectral sparsification to produce good visual representations of big graphs. We evaluate spectral sparsification approaches on real-world and synthetic graphs. We show that spectral sparsifiers are more effective than random edge sampling. Our results lead to guidelines for using spectral sparsification in big graph visualization. © Springer international Publishing AG 2018.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Experimental evaluation of book drawing algorithms 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Klawitter, Jonathan McHedlidze, Tamara Nöllenburg, Martin University of Auckland Auckland New Zealand Karlsruhe Institute of Technology Karlsruhe Germany TU Wien Vienna Austria

ISBN: (纸本)9783319739144

A k-page book drawing of a graph G = (V,E) consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the k pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and only if they are assigned to the same page and their vertices alternate along the spine. Crossing minimization in a k-page book drawing is NP-hard, yet book drawings have multiple applications in visualization and beyond. therefore several heuristic book drawing algorithms exist, but there is no broader comparative study on their relative performance. In this paper, we propose a comprehensive benchmark set of challenging graph classes for book drawing algorithms and provide an extensive experimental study of the performance of existing book drawing algorithms. © Springer international Publishing AG 2018.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

On the edge-length ratio of outerplanar graphs 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Lazard, Sylvain Lenhart, William Liotta, Giuseppe Inria CNRS University of Lorraine Nancy France Williams College Williamstown United States University of Perugia Perugia Italy

ISBN: (纸本)9783319739144

We show that any outerplanar graph admits a planar straight-line drawing such that the length ratio of the longest to the shortest edges is strictly less than 2. this result is tight in the sense that for any Ε > 0 there are outerplanar graphs that cannot be drawn with an edge-length ratio smaller than 2 - Ε We also show that every bipartite outerplanar graph has a planar straight-line drawing with edge-length ratio 1, and that, for any k ≥ 1 there exists an outerplanar graph with a given combinatorial embedding such that any planar straight-line drawing has edge-length ratio greater than k. © Springer international Publishing AG 2018.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

A Greedy Heuristic for Crossing-Angle Maximization 26th

A Greedy Heuristic for Crossing-Angle Maximization

引用

26th international symposium on graph drawing and network visualization (gd)

作者： Demel, Almut Durrschnabel, Dominik Mchedlidze, Tamara Radermacher, Marcel Wulf, Lasse Karlsruhe Inst Technol Dept Comp Sci Karlsruhe Germany

ISBN: (纸本)9783030044145;9783030044138

the crossing angle of a straight-line drawing Gamma of a graph G = (V, E) is the smallest angle between two crossing edges in Gamma. Deciding whether a graph G has a straight-line drawing with a crossing angle of 90 is NP-hard [I]. We propose a simple heuristic to compute a drawing with a large crossing angle. the heuristic greedily selects the best position for a single vertex in a random set of points. the algorithm is accompanied by a speed-up technique to compute the crossing angle of a straight-line drawing. We show the effectiveness of the heuristic in an extensive empirical evaluation. Our heuristic was clearly the winning algorithm (CoffeeVM) in the graph drawing Challenge 2017 [6].

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Mixed linear layouts of planar graphs 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Pupyrev, Sergey University of Arizona TucsonAZ United States

ISBN: (纸本)9783319739144

A k-stack (respectively, k-queue) layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges with respect to the vertex ordering. In 1992, Heath and Rosenberg conjectured that every planar graph admits a mixed 1-stack 1-queue layout in which every edge is assigned to a stack or to a queue that use a common vertex ordering. We disprove this conjecture by providing a planar graph that does not have such a mixed layout. In addition, we study mixed layouts of graph subdivisions, and show that every planar graph has a mixed subdivision with one division vertex per edge. © Springer international Publishing AG 2018.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

graph drawing and network visualization 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Fabrizio Frati Kwan-Liu Ma

ISBN: (数字)9783319739151

ISBN: (纸本)9783319739144

this book constitutes revised selected papers from the 25th international symposium on graph drawing and network visualization, gd 2017, held in Boston, MA, USA, in September 2017.;the 34 full and 9 short papers presented in this volume were carefully reviewed and selected from 87 submissions. Also included in this book are 2 abstracts of keynote presentations, 16 poster abstracts, and 1 contest report. the papers are organized in topical sections named: straight-line representations; obstacles and visibility; topological graph theory; orthogonal representations and book embeddings; evaluations; tree drawings; graph layout designs; point-set embeddings; special representations; and beyond planarity.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer graphics Data Structures Software Engineering Computer Appl. in Social and Behavioral Sciences

来源：评论

学校读者我要写书评

暂无评论

Re-embedding a 1-Plane graph into a Straight-Line drawing in Linear Time 24th

引用

24th international symposium on graph drawing and network visualization (gd)

作者： Hong, Seok-Hee Nagamochi, Hiroshi Univ Sydney Sydney NSW Australia Kyoto Univ Kyoto Japan

ISBN: (纸本)9783319501062;9783319501055

thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. thomassen, Rectilinear drawings of graphs, J. graph theory, 10(3), 335-341, 1988]. In this paper, we characterize some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph can be re-embedded into a straight-line drawable 1-plane embedding of the same graph if and only if it does not contain the configuration. Reembedding of a 1-plane embedding preserves the same set of pairs of crossing edges. We give a linear-time algorithm for finding a straight-line drawable 1-plane re-embedding or the forbidden configuration.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

drawing dynamic graphs without timeslices 25th

引用

25th international symposium on graph drawing and network visualization, gd 2017

作者： Simonetto, Paolo Archambault, Daniel Kobourov, Stephen Swansea University Swansea United Kingdom University of Arizona Tucson United States

ISBN: (纸本)9783319739144

Timeslices are often used to draw and visualize dynamic graphs. While timeslices are a natural way to think about dynamic graphs, they are routinely imposed on continuous data. Often, it is unclear how many timeslices to select: too few timeslices can miss temporal features such as causality or even graph structure while too many timeslices slows the drawing computation. We present a model for dynamic graphs which is not based on timeslices, and a dynamic graph drawing algorithm, DynNoSlice, to draw graphs in this model. In our evaluation, we demonstrate the advantages of this approach over timeslicing on continuous data sets. © Springer international Publishing AG 2018.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共4页 << < 1 2 3 4 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：