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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

18 篇 会议
2 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

16 篇 工学
- 12 篇 建筑学
- 12 篇 土木工程
- 12 篇 测绘科学与技术
- 6 篇 计算机科学与技术...
- 4 篇 软件工程
- 1 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 生物工程
9 篇 理学
- 9 篇 数学
- 1 篇 生物学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...

主题

9 篇 drawing (graphic...
3 篇 visualization
3 篇 graph theory
1 篇 covid-19
1 篇 graph drawing
1 篇 theory of comput...
1 篇 deep neural netw...
1 篇 kernelization
1 篇 discrete mathema...
1 篇 data structures ...
1 篇 parameterized al...
1 篇 computer imaging...
1 篇 parameterized co...
1 篇 crossing minimiz...

机构

3 篇 department of ap...
2 篇 tu eindhoven ein...
2 篇 universität trie...
2 篇 institute of the...
2 篇 alfréd rényi ins...
1 篇 department of en...
1 篇 university of gl...
1 篇 czech academy of...
1 篇 fernuniversität ...
1 篇 universität würz...
1 篇 univ trier trier
1 篇 utrecht universi...
1 篇 univ erlangen nu...
1 篇 univ cologne dep...
1 篇 labri umr cnrs 5...
1 篇 university of pa...
1 篇 eindhoven univer...
1 篇 institute of mat...
1 篇 institut für mat...
1 篇 faculty of compu...

作者

3 篇 kindermann phili...
2 篇 valtr pavel
2 篇 ueckerdt torsten
2 篇 mchedlidze tamar...
2 篇 meulemans wouter
2 篇 tóth géza
2 篇 klute fabian
1 篇 angelini patrizi...
1 篇 merker laura
1 篇 frati fabrizio
1 篇 gehér panna
1 篇 schlipf lena
1 篇 gronemann martin
1 篇 mambelli frances...
1 篇 balko martin
1 篇 eppstein david
1 篇 helen c. purchas...
1 篇 purchase helen
1 篇 chaplick steven
1 篇 čížek tomáš

语言

21 篇 英文

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

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

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

详细简洁

排序：

29th international symposium on graph drawing and network visualization, gd 2021

29th International Symposium on Graph Drawing and Network Vi...

引用

29th international symposium on graph drawing and network visualization, gd 2021

ISBN: (纸本)9783030929305

the proceedings contain 29 papers. the special focus in this conference is on graph drawing and network visualization. the topics include: Upward Planar drawings with three and More Slopes;planar Straight-Line Realizations of 2-Trees with Prescribed Edge Lengths;one-Bend drawings of Outerplanar graphs Inside Simple Polygons;quasi-upward Planar drawings with Minimum Curve Complexity;non-homotopic Loops with a Bounded Number of Pairwise Intersections;on the Number of Edges of Separated Multigraphs;on the Queue-Number of Partial Orders;on the Upward Book thickness Problem: Combinatorial and Complexity Results;linear Layouts of Complete graphs;a User Study on Hybrid graph visualizations;on the Queue Number of Planar graphs;optimal-Area Visibility Representations of Outer-1-Plane graphs;unit Disk Representations of Embedded Trees, Outerplanar and Multi-legged graphs;layered Area-Proportional Rectangle Contact Representations;arrangements of Orthogonal Circles with Many Intersections;limitations on Realistic Hyperbolic graph drawing;embedding Ray Intersection graphs and Global Curve Simplification;Deep Neural network for drawing networks,(DNN)2;implementation of Sprouts: A graph drawing Game;graph drawing Contest Report;star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics;simplifying Non-simple Fan-Planar drawings;RAC -Drawability is ∃ R -Complete;recognizing and Embedding Simple Optimal 2-Planar graphs;a Short Proof of the Non-biplanarity of K9;from Tutte to Floater and Gotsman: On the Resolution of Planar Straight-Line drawings and Morphs;planar and Toroidal Morphs Made Easier.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Special Issue of Selected Papers from the 29th international symposium on graph drawing and network visualization (gd 2021) Guest Editors’ Foreword

引用

Journal of graph Algorithms and Applications 2023年第2期27卷 45-47页

作者： Rutter, Ignaz Purchase, Helen Faculty of Computer Science and Mathematics University of Passau Passau Germany Department of Human Centred Computing Monash University Melbourne Australia

来源：评论

学校读者我要写书评

暂无评论

graph drawing Contest Report 30th

Graph Drawing Contest Report

引用

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

作者： Kindermann, Philipp Klute, Fabian Mchedlidze, Tamara Meulemans, Wouter Univ Trier Trier Germany Univ Utrecht Utrecht Netherlands TU Eindhoven Eindhoven Netherlands

ISBN: (纸本)9783031222023;9783031222030

this report describes the 29th Annual graph drawing Contest, held in conjunction with the 30th international symposium on graph drawing and network visualization (gd'22) in Tokyo, Japan. Due to the continuing global COVID-19 pandemic, the conference and thus also the contest was held in a hybrid format, with both on-site and online participants. the mission of the graph drawing Contest is to monitor and challenge the current state of the art in graph-drawing technology.

关键词： COVID-19

来源：评论

学校读者我要写书评

暂无评论

graph drawing Contest Report 29th

Graph Drawing Contest Report

引用

29th international symposium on graph drawing and network visualization, gd 2021

作者： Kindermann, Philipp Mchedlidze, Tamara Meulemans, Wouter Universität Trier Trier Germany Universiteit Utrecht Utrecht Netherlands Eindhoven University of Technology Eindhoven Netherlands

ISBN: (纸本)9783030929305

this report describes the 28th Annual graph drawing Contest, held in conjunction with the 29th international symposium on graph drawing and network visualization (gd’21) in Tübingen, Germany. Due to the global COVID-19 pandemic, the conference and thus also the contest was held in a hybrid format, with both on-site and online participants. the mission of the graph drawing Contest is to monitor and challenge the current state of the art in graph-drawing technology. © 2021, Springer Nature Switzerland AG.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Limitations on Realistic Hyperbolic graph drawing 29th

Limitations on Realistic Hyperbolic Graph Drawing

引用

29th international symposium on graph drawing and network visualization, gd 2021

作者： Eppstein, David Computer Science Department University of California Irvine IrvineCA92697 United States

ISBN: (纸本)9783030929305

We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximated by Euclidean distance. therefore, for these types of drawing, hyperbolic geometry provides no benefit over Euclidean graph drawing. © 2021, Springer Nature Switzerland AG.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

One-Bend drawings of Outerplanar graphs Inside Simple Polygons 29th

One-Bend Drawings of Outerplanar Graphs Inside Simple Polyg...

引用

29th international symposium on graph drawing and network visualization, gd 2021

作者： Angelini, Patrizio Kindermann, Philipp Löffler, Andre Schlipf, Lena Symvonis, Antonios John Cabot University Rome Italy Universität Trier Trier Germany Universität Würzburg Würzburg Germany Universität Tübingen Tübingen Germany National Technical University of Athens Athens Greece

ISBN: (纸本)9783030929305

We consider the problem of drawing an outerplanar graph with n vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in O(nm) time if such a drawing exists, where m≤ n- 3 is the number of interior edges. In the positive case, we can also compute such a drawing. © 2021, Springer Nature Switzerland AG.

关键词： drawing (graphics)

来源：评论

学校读者我要写书评

暂无评论

Deep Neural network for drawing networks,(DNN)2 29th

Deep Neural Network for DrawiNg Networks,(DNN)2

引用

29th international symposium on graph drawing and network visualization, gd 2021

作者： Giovannangeli, Loann Lalanne, Frederic Auber, David Giot, Romain Bourqui, Romain LaBRI UMR CNRS 5800 University Bordeaux Talence33405 France

ISBN: (纸本)9783030929305

By leveraging recent progress of stochastic gradient descent methods, several works have shown that graphs could be efficiently laid out through the optimization of a tailored objective function. In the meantime, Deep Learning (DL) techniques achieved great performances in many applications. We demonstrate that it is possible to use DL techniques to learn a graph-to-layout sequence of operations thanks to a graph-related objective function. In this paper, we present a novel graph drawing framework called (DNN)2 : Deep Neural network for drawing networks. Our method uses graph Convolution networks to learn a model. Learning is achieved by optimizing a graph topology related loss function that evaluates (DNN)2 generated layouts during training. Once trained, the (DNN)2 model is able to quickly lay any input graph out. We experiment (DNN)2 and statistically compare it to optimization-based and regular graph layout algorithms. the results show that (DNN)2 performs well and are encouraging as the Deep Learning approach to graph drawing is novel and many leads for future works are identified. © 2021, Springer Nature Switzerland AG.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Crossing Minimization in Storyline visualization 24th

引用

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

作者： Gronemann, Martin Juenger, Michael Liers, Frauke Mambelli, Francesco Univ Cologne Dept Comp Sci Cologne Germany Univ Erlangen Nurnberg Dept Math Erlangen Germany

ISBN: (纸本)9783319501062;9783319501055

A storyline visualization is a layout that represents the temporal dynamics of social interactions along time by the convergence of chronological lines. Among the criteria oriented at improving aesthetics and legibility of a representation of this type, a small number of line crossings is the hardest to achieve. We model the crossing minimization in the storyline visualization problem as a multi-layer crossing minimization problem with tree constraints. Our algorithm can compute a layout with the minimum number of crossings of the chronological lines. Computational results demonstrate that it can solve instances with more than 100 interactions and with more than 100 chronological lines to optimality.

关键词： visualization

来源：评论

学校读者我要写书评

暂无评论

Arrangements of Orthogonal Circles with Many Intersections 29th

Arrangements of Orthogonal Circles with Many Intersections

引用

29th international symposium on graph drawing and network visualization, gd 2021

作者： Carmesin, Sarah Schulz, André FernUniversität in Hagen Universitätsstraße 47 Hagen58097 Germany

ISBN: (纸本)9783030929305

An arrangement of circles in which circles intersect only in angles of π/ 2 is called an arrangement of orthogonal circles. We show that in the case that no two circles are nested, the intersection graph of such an arrangement is planar. the same result holds for arrangement of circles that intersect in an angle of at most π/ 2. For the general case we prove that the maximal number of edges in an intersection graph of an arrangement of orthogonal circles lies in between 4n-O(n) and (4+511)n, for n being the number of circles. Based on the lower bound we can also improve the bound for the number of triangles in arrangements of orthogonal circles to (3+5/9)n-O(n). © 2021, Springer Nature Switzerland AG.

关键词： graph theory

来源：评论

学校读者我要写书评

暂无评论

graph drawing and network visualization 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Helen C. Purchase Ignaz Rutter

this book constitutes the proceedings of the 28th international symposium on graph drawing and network visualization, gd 2021, which was held in Tübingen, Germany, during September 14-17, 2021.

ISBN: (数字)9783030929312

ISBN: (纸本)9783030929305

this book constitutes the proceedings of the 28th international symposium on graph drawing and network visualization, gd 2021, which was held in Tübingen, Germany, during September 14-17, 2021.

关键词： theory of Computation Computer Imaging, Vision, Pattern Recognition and graphics Data Structures and Information theory Discrete Mathematics in Computer Science

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：