語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Graph Drawing and Network Visualizat...
~
Rutter, Ignaz.
Graph Drawing and Network Visualization = 29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers /
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Graph Drawing and Network Visualization/ edited by Helen C. Purchase, Ignaz Rutter.
其他題名:
29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers /
其他作者:
Rutter, Ignaz.
面頁冊數:
XXII, 464 p. 221 illus., 137 illus. in color.online resource. :
Contained By:
Springer Nature eBook
標題:
Discrete Mathematics in Computer Science. -
電子資源:
https://doi.org/10.1007/978-3-030-92931-2
ISBN:
9783030929312
Graph Drawing and Network Visualization = 29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers /
Graph Drawing and Network Visualization
29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers /[electronic resource] :edited by Helen C. Purchase, Ignaz Rutter. - 1st ed. 2021. - XXII, 464 p. 221 illus., 137 illus. in color.online resource. - Information Systems and Applications, incl. Internet/Web, and HCI ;12868. - Information Systems and Applications, incl. Internet/Web, and HCI ;9149.
Best Paper (Track 1: Combinatorial and Algorithmic Aspects) -- Edge-Minimum Saturated $k$-Planar Drawings -- Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects) -- A User Study on Hybrid Graph Visualizations- Crossing Minimization and Beyond-Planarity Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics -- Simplifying Non-Simple Fan-Planar Drawings -- RAC-drawability is ER-complete -- Recognizing and Embedding Simple Optimal 2-Planar Graphs -- A short proof of the non-biplanarity of K 9 -- Morphing and Graph Abstraction -- From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs -- Planar and Toroidal Morphs Made Easier -- Visualizing JIT Compiler Graphs -- Geometric Constraints -- 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 -- Topological and Upward Drawings -- 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 -- Linear Layouts -- On the Queue-Number of Partial Orders -- On the Upward Book Thickness Problem: Combinatorial and Complexity Results -- Linear Layouts of Complete Graphs -- On the Queue Number of Planar Graphs -- Contact and Visibility Representations -- 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 Representation -- Geometric Aspects in Graph Drawing -- Arrangements of orthogonal circles with many intersections -- Limitations on Realistic Hyperbolic Graph Drawing -- Embedding Ray Intersection Graphs and Global Curve Simplification -- AI Applications -- Drawing Networks with Deep Neural Network, (DNN)² -- Implementation of Sprouts: a graph drawing game -- Graph Drawing Contest Report. .
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. The 23 full papers and 5 short papers presented in these proceedings were carefully reviewed and selected from 74 submissions. The abstracts of 13 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: Best Paper (Track 1: Combinatorial and Algorithmic Aspects); Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects); Crossing Minimization and Beyond-Planarity; Morphing and Graph Abstraction; Geometric Constraints; Topological and Upward Drawings; Linear Layouts; Contact and Visibility Representations; Geometric Aspects in Graph Drawing; AI applications; and Graph Drawing Contest Report. .
ISBN: 9783030929312
Standard No.: 10.1007/978-3-030-92931-2doiSubjects--Topical Terms:
670123
Discrete Mathematics in Computer Science.
LC Class. No.: QA75.5-76.95
Dewey Class. No.: 004.0151
Graph Drawing and Network Visualization = 29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers /
LDR
:04529nam a22004335i 4500
001
1057773
003
DE-He213
005
20211222192526.0
007
cr nn 008mamaa
008
220103s2021 sz | s |||| 0|eng d
020
$a
9783030929312
$9
978-3-030-92931-2
024
7
$a
10.1007/978-3-030-92931-2
$2
doi
035
$a
978-3-030-92931-2
050
4
$a
QA75.5-76.95
050
4
$a
QA76.63
072
7
$a
UY
$2
bicssc
072
7
$a
COM014000
$2
bisacsh
072
7
$a
UY
$2
thema
072
7
$a
UYA
$2
thema
082
0 4
$a
004.0151
$2
23
245
1 0
$a
Graph Drawing and Network Visualization
$h
[electronic resource] :
$b
29th International Symposium, GD 2021, Tübingen, Germany, September 14–17, 2021, Revised Selected Papers /
$c
edited by Helen C. Purchase, Ignaz Rutter.
250
$a
1st ed. 2021.
264
1
$a
Cham :
$b
Springer International Publishing :
$b
Imprint: Springer,
$c
2021.
300
$a
XXII, 464 p. 221 illus., 137 illus. in color.
$b
online resource.
336
$a
text
$b
txt
$2
rdacontent
337
$a
computer
$b
c
$2
rdamedia
338
$a
online resource
$b
cr
$2
rdacarrier
347
$a
text file
$b
PDF
$2
rda
490
1
$a
Information Systems and Applications, incl. Internet/Web, and HCI ;
$v
12868
505
0
$a
Best Paper (Track 1: Combinatorial and Algorithmic Aspects) -- Edge-Minimum Saturated $k$-Planar Drawings -- Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects) -- A User Study on Hybrid Graph Visualizations- Crossing Minimization and Beyond-Planarity Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics -- Simplifying Non-Simple Fan-Planar Drawings -- RAC-drawability is ER-complete -- Recognizing and Embedding Simple Optimal 2-Planar Graphs -- A short proof of the non-biplanarity of K 9 -- Morphing and Graph Abstraction -- From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs -- Planar and Toroidal Morphs Made Easier -- Visualizing JIT Compiler Graphs -- Geometric Constraints -- 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 -- Topological and Upward Drawings -- 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 -- Linear Layouts -- On the Queue-Number of Partial Orders -- On the Upward Book Thickness Problem: Combinatorial and Complexity Results -- Linear Layouts of Complete Graphs -- On the Queue Number of Planar Graphs -- Contact and Visibility Representations -- 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 Representation -- Geometric Aspects in Graph Drawing -- Arrangements of orthogonal circles with many intersections -- Limitations on Realistic Hyperbolic Graph Drawing -- Embedding Ray Intersection Graphs and Global Curve Simplification -- AI Applications -- Drawing Networks with Deep Neural Network, (DNN)² -- Implementation of Sprouts: a graph drawing game -- Graph Drawing Contest Report. .
520
$a
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. The 23 full papers and 5 short papers presented in these proceedings were carefully reviewed and selected from 74 submissions. The abstracts of 13 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: Best Paper (Track 1: Combinatorial and Algorithmic Aspects); Best Paper (Track 2: Experimental, Applied, and Network Visualization Aspects); Crossing Minimization and Beyond-Planarity; Morphing and Graph Abstraction; Geometric Constraints; Topological and Upward Drawings; Linear Layouts; Contact and Visibility Representations; Geometric Aspects in Graph Drawing; AI applications; and Graph Drawing Contest Report. .
650
2 4
$a
Discrete Mathematics in Computer Science.
$3
670123
650
2 4
$a
Data Structures and Information Theory.
$3
1211601
650
2 4
$a
Computer Imaging, Vision, Pattern Recognition and Graphics.
$3
671334
650
1 4
$a
Theory of Computation.
$3
669322
650
0
$a
Computer science—Mathematics.
$3
1253519
650
0
$a
Data structures (Computer science).
$3
680370
650
0
$a
Optical data processing.
$3
639187
650
0
$a
Computers.
$3
565115
700
1
$a
Rutter, Ignaz.
$e
editor.
$1
https://orcid.org/0000-0002-3794-4406
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1363289
700
1
$a
Purchase, Helen C.
$e
editor.
$1
https://orcid.org/0000-0001-6994-4446
$4
edt
$4
http://id.loc.gov/vocabulary/relators/edt
$3
1363288
710
2
$a
SpringerLink (Online service)
$3
593884
773
0
$t
Springer Nature eBook
776
0 8
$i
Printed edition:
$z
9783030929305
776
0 8
$i
Printed edition:
$z
9783030929329
830
0
$a
Information Systems and Applications, incl. Internet/Web, and HCI ;
$v
9149
$3
1253558
856
4 0
$u
https://doi.org/10.1007/978-3-030-92931-2
912
$a
ZDB-2-SCS
912
$a
ZDB-2-SXCS
912
$a
ZDB-2-LNC
950
$a
Computer Science (SpringerNature-11645)
950
$a
Computer Science (R0) (SpringerNature-43710)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入