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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是21-30 订阅

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

详细简洁

排序：

thrackles: An improved upper bound 25th

引用

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

作者： Fulek, Radoslav Pach, János IST Austria Am Campus 1 Klosterneuburg3400 Austria École Polytechnique Fédérale de Lausanne Station 8 Lausanne1015 Switzerland Rényi Institute Hungarian Academy of Sciences P.O. Box 127 Budapest1364 Hungary

ISBN: (纸本)9783319739144

A thrackle is a graph drawn in the plane so that every pair of its edges meet exactly once: either at a common end vertex or in a proper crossing. We prove that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are defined similarly, except that every pair of edges that do not share a vertex are allowed to cross an odd number of times. It is also shown that the maximum number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound is best possible for infinitely many values of n. © Springer international Publishing AG 2018.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Maximizing Ink in Partial Edge drawings of k-plane graphs 27th

Maximizing Ink in Partial Edge Drawings of k-plane Graphs

引用

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

作者： Hummel, Matthias Klute, Fabian Nickel, Soeren Noellenburg, Martin TU Wien Algorithms & Complex Grp Vienna Austria

ISBN: (纸本)9783030358020;9783030358013

Partial edge drawing (PED) is a drawing style for non-planar graphs, in which edges are drawn only partially as pairs of opposing stubs on the respective end-vertices. In a PED, by erasing the central parts of edges, all edge crossings and the resulting visual clutter are hidden in the undrawn parts of the edges. In symmetric partial edge drawings (SPEDs), the two stubs of each edge are required to have the same length. It is known that maximizing the ink (or the total stub length) when transforming a straight-line graph drawing with crossings into a SPED is tractable for 2-plane input drawings, but NP-hard for unrestricted inputs. We show that the problem remains NP-hard even for 3-plane input drawings and establish NP-hardness of ink maximization for PEDs of 4-plane graphs. Yet, for k-plane input drawings whose edge intersection graph forms a collection of trees or, more generally, whose intersection graph has bounded treewidth, we present efficient algorithms for computing maximum-ink PEDs and SPEDs. We implemented the treewidth-based algorithms and show a brief experimental evaluation.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Revisited experimental comparison of node-link and matrix representations 25th

引用

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

作者： Okoe, Mershack Jianu, Radu Kobourov, Stephen Department of Computer Science Florida International University Miami United States Gicentre City University of London London United Kingdom Department of Computer Science University of Arizona Tucson United States

ISBN: (纸本)9783319739144

Visualizing network data is applicable in domains such as biology, engineering, and social sciences. We report the results of a study comparing the effectiveness of the two primary techniques for showing network data: node-link diagrams and adjacency matrices. Specifically, an evaluation with a large number of online participants revealed statistically significant differences between the two visualizations. Our work adds to existing research in several ways. First, we explore a broad spectrum of network tasks, many of which had not been previously evaluated. Second, our study uses a large dataset, typical of many real-life networks not explored by previous studies. third, we leverage crowdsourcing to evaluate many tasks with many participants. © Springer international Publishing AG 2018.

关键词： Large dataset

来源：评论

学校读者我要写书评

暂无评论

Colored point-set embeddings of acyclic graphs 25th

引用

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

作者： Di Giacomo, Emilio Gasieniec, Leszek Liotta, Giuseppe Navarra, Alfredo Università degli Studi di Perugia Perugia Italy University of Liverpool Liverpool United Kingdom

ISBN: (纸本)9783319739144

We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require Ω(n2/3) edges each having Ω (n1/3) bends in the worst case. the lower bound holds even when the function that maps vertices to points is not a bijection but it is defined by a 3-coloring. In contrast, a constant number of bends per edge can be obtained for 3-colored paths and for 3-colored caterpillars whose leaves all have the same color. Such results answer to a long standing open problem. © Springer international Publishing AG 2018.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

CHORDLINK: A New Hybrid visualization Model 27th

CHORDLINK: A New Hybrid Visualization Model

引用

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

作者： Angori, Lorenzo Didimo, Walter Montecchiani, Fabrizio Pagliuca, Daniele Tappini, Alessandra Univ Perugia Dipartimento Ingn Perugia Italy Agenzia Entrate Arezzo Italy

ISBN: (纸本)9783030358020;9783030358013

Many real-world networks are globally sparse but locally dense. Typical examples are social networks, biological networks, and information networks. this double structural nature makes it difficult to adopt a homogeneous visualization model that clearly conveys an overview of the network and the internal structure of its communities at the same time. As a consequence, the use of hybrid visualizations has been proposed. For instance, NodeTrix combines node-link and matrix-based representations (Henry et al., 2007). In this paper we describe ChordLink, a hybrid visualization model that embeds chord diagrams, used to represent dense subgraphs, into a node-link diagram, which shows the global network structure. the visualization is intuitive and makes it possible to interactively highlight the structure of a community while keeping the rest of the layout stable. We discuss the intriguing algorithmic challenges behind the ChordLink model, present a prototype system, and illustrate case studies on real-world networks.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Improved bounds for drawing trees on fixed points with L-Shaped edges 25th

引用

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

作者： Biedl, therese Chan, Timothy M. Derka, Martin Jain, Kshitij Lubiw, Anna University of Waterloo WaterlooONN2L 3G1 Canada University of Illinois at Urbana-Champaign UrbanaIL United States

ISBN: (纸本)9783319739144

Let T be an n-node tree of maximum degree 4, and let P be a set of n points in the plane with no two points on the same horizontal or vertical line. It is an open question whether T always has a planar drawing on P such that each edge is drawn as an orthogonal path with one bend (an "L-shaped" edge). By giving new methods for drawing trees, we improve the bounds on the size of the point set P for which such drawings are possible to: O(n1.55) for maximum degree 4 trees;O(n1.22) for maximum degree 3 (binary) trees;and O(n1.142) for perfect binary trees. drawing ordered trees with L-shaped edges is harder—we give an example that cannot be done and a bound of O(n log n) points for L-shaped drawings of ordered caterpillars, which contrasts with the known linear bound for unordered caterpillars. © Springer international Publishing AG 2018.

关键词： Binary trees

来源：评论

学校读者我要写书评

暂无评论

Computing storyline visualizations with few block crossings 25th

引用

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

作者： van Dijk, thomas C. Lipp, Fabian Markfelder, Peter Wolff, Alexander Lehrstuhl für Informatik I Universität Würzburg Würzburg Germany

ISBN: (纸本)9783319739144

Storyline visualizations show the structure of a story, by depicting the interactions of the characters over time. Each character is represented by an x-monotone curve from left to right, and a meeting is represented by having the curves of the participating characters run close together for some time. there have been various approaches to drawing storyline visualizations in an automated way. In order to keep the visual complexity low, rather than minimizing pairwise crossings of curves, we count block crossings, that is, pairs of intersecting bundles of lines. Partly inspired by the ILP-based approach of Gronemann et al. [gd 2016] for minimizing the number of pairwise crossings, we model the problem as a satisfiability problem (since the straightforward ILP formulation becomes more complicated and harder to solve). Having restricted ourselves to a decision problem, we can apply powerful SAT solvers to find optimal drawings in reasonable time. We compare this SAT-based approach with two exact algorithms for block crossing minimization, using both the benchmark instances of Gronemann et al. and random instances. We show that the SAT approach is suitable for real-world instances and identify cases where the other algorithms are preferable. © Springer international Publishing AG 2018.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Planar Rectilinear drawings of Outerplanar graphs in Linear Time 28th

Planar Rectilinear Drawings of Outerplanar Graphs in Linear ...

引用

28th international symposium on graph drawing and network visualization, gd 2020

作者： Frati, Fabrizio Roma Tre University Rome Italy

We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding and if it does not. Our algorithm returns a planar rectilinear dr... 详细信息

ISBN: (纸本)9783030687656

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Line and Plane Cover Numbers Revisited 27th

Line and Plane Cover Numbers Revisited

引用

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

作者： Biedl, therese Felsner, Stefan Meijer, Henk Wolff, Alexander Univ Waterloo Waterloo ON Canada TU Berlin Berlin Germany Univ Coll Roosevelt Middelburg Netherlands Univ Wurzburg Wurzburg Germany

ISBN: (纸本)9783030358020;9783030358013

A measure for the visual complexity of a straight-line crossing-free drawing of a graph is the minimum number of lines needed to cover all vertices. For a given graph G, the minimum such number (over all drawings in dimension d is an element of {2, 3}) is called the d-dimensional weak line cover number and denoted by pi(1)(d)(G). In 3D, the minimum number of planes needed to cover all vertices of G is denoted by pi(2)(3)(G). When edges are also required to be covered, the corresponding numbers rho(1)(d)(G) and rho(2)(3) (G) are called the (strong) line cover number and the (strong) plane cover number. Computing any of these cover numbers-except pi(1)(2)(G)-is known to be NP-hard. the complexity of computing pi(1)(2)(G) was posed as an open problem by Chaplick et al. [WADS 2017]. We show that it is NP-hard to decide, for a given planar graph G, whether pi(1)(2)(G) = 2. We further show that the universal stacked triangulation of depth d, G(d), has pi(1)(2)(G(d)) = d+ 1. Concerning 3D, we show that any n-vertex graph G with rho(2)(3)(G) = 2 has at most 5n - 19 edges, which is tight.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Gap-planar graphs 25th

引用

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

作者： Bae, Sang Won Baffier, Jean-Francois Chun, Jinhee Eades, Peter Eickmeyer, Kord Grilli, Luca Hong, Seok-Hee Korman, Matias Montecchiani, Fabrizio Rutter, Ignaz Tóth, Csaba D. Kyonggi University Suwon Korea Republic of National Institute of Informatics Tokyo Japan Tohoku University Sendai Japan University of Sydney Sydney Australia TU Darmstadt Darmstadt Germany University of Perugia Perugia Italy TU Eindhoven Eindhoven Netherlands California State University Northridge Los Angeles United States

ISBN: (纸本)9783319739144

We introduce the family of k-gap-planar graphs for k ≥ 0, i.e., graphs that have a drawing in which each crossing is assigned to one of the two involved edges and each edge is assigned at most k of its crossings. this definition finds motivation in edge casing, as a k-gap-planar graph can be drawn crossing-free after introducing at most k local gaps per edge. We obtain results on the maximum density, drawability of complete graphs, complexity of the recognition problem, and relationships with other families of beyond-planar graphs. © Springer international Publishing AG 2018.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：