|
|
 |
| Авторизация |
|
|
|
| Поиск по указателям |
|
|
|
|
|
|
|
 |
|
|
|
| Di Battista G. — Graph Drawing: Algorithms for the Visualization of Graphs |
|
|
|
| Предметный указатель |
Maximum Euclidean distance 337
Maximum planar subgraph 216
Median incoming edges 260
Median method 285
Mental map 219
method 31
Metrics 20
Minimum cost flow problem 145
Minimum energy configuration 29
Minimum energy state 320
Minimum spanning tree drawing 339
Multiple edge 3
Mutual nearest neighbor drawing, graph 339
Mutual nearest neighbor graph 339
Nearest neighbor graph realization 339
Neighbor 4
Network 144
Newton — Raphson iteration 310
No-change scenario 222
Node of a network 144
Nonseparating cycle 75
Not-all-equal-3-sat 201 332
NP-complete 130 172 201 209 273 279—281 295 331 338 339
NP-hard 49 137 215 331 332 335 338 339
Object of a planar st-graph 96
Open component 67 121
Optimal-Orthogonal 162
Ordered set, upward planar drawing 210—212
Ordered tree 42
Orthogonal drawing 12
Orthogonal drawing, biconnected graph 240—253
Orthogonal drawing, digraph 315
Orthogonal drawing, graph 18—22 218—235 253—262
Orthogonal drawing, planar graph 130—132 139—169
Orthogonal representation 142
Orthogonal-from-Visibility 131
Orthogonalization 20
Orthogonalize 149
Outdegree 4
Outer path 201
Outerplanar 209
Outerplanar acyclic digraph upward planar drawing 209
Outgoing edge 4
P-node 66
Pairing 241
Pairing technique 239
Parent 42
Parse tree 65
Path 4
Peak 198
PERT diagram 14 16 22 111
Piece 75
Pivot vertex 283
Planar acyclic digraph, planar straight-line upward drawing 327—331
Planar acyclic digraph, upward planar drawing 172—192 201—209
Planar bipartite digraph, upward planar drawing 212
Planar clustered graph, planar straight-line drawing 327
Planar drawing 7 13
Planar drawing with bounded angular resolution, planar graph 327
Planar drawing, graph 74—81
Planar drawing, ordered set 210—212
Planar drawing, outerplanar acyclic digraph 209
Planar drawing, planar acyclic digraph 172—212 327—331
Planar drawing, planar bipartite digraph 212
Planar drawing, planar clustered graph 327
Planar drawing, planar graph 127—134 139—169 309—312 335—338
Planar drawing, planar layered digraph 327
Planar drawing, planar st-graph 107—112 212
Planar drawing, rooted tree 43—64
Planar drawing, series-parallel digraph 64—74 212 327
Planar drawing, single-source planar acyclic digraph 192—200 209—210
Planar drawing, tree 338
Planar embedding 7 20
Planar graph 7 33
Planar graph,  -visibility representation 129—130
Planar graph, convex drawing 311
Planar graph, planar orthogonal drawing 139—150 164—169
Planar graph, planar orthogonal grid drawing 130—132 151—162
Planar graph, planar polyline drawing 127—129
Planar graph, planar straight-line drawing 309—312
Planar graph, planar straight-line drawing with bounded angular resolution 327
Planar graph, planar straight-line grid drawing 132—134
Planar graph, tessellation representation 127—129
Planar graph, unit length planar straight-line drawing 335—338
Planar graph, visibility representation 127—132 165—168
Planar layered digraph, planar layered drawing 327
Planar st-graph 91
Planar st-graph, inclusion in 172
Planar st-graph, polyline dominance drawing 126—127
Planar st-graph, tessellation representation 96—99
Planar st-graph, upward planar drawing 212
Planar st-graph, upward planar polyline grid drawing 107—112
Planar st-graph, visibility representation 99—112
Planar st-graphs, interactive drawing 219
Planarity testing 74—81
Planarity-Testing 80
Planarization 20 25 27 216
Planarization operation 216
Planarize 218
Platonic solid 29
Pole of a tendril 201
POLYLINE 107
Polyline drawing 12
Polyline drawing, digraph 22—25
Polyline drawing, graph 25—29
Polyline drawing, planar graph 127—129
Polyline drawing, planar st-graph 107—112 126—127
potential energy 312
Precedence-constrained multiprocessor scheduling problem 273
Predecessor 241 260
Prescribed-region 69
Proper layered digraph 22 269
Properly visible 175
Q-node 65
Radial drawing 52
Rectangular refinement 158
Recursive-Wind-Tree-Draw 60—64
Reduced digraph 5
Reduced planar st-graph, dominance drawing 112—126
Regular graph 241
Relative-coordinates scenario 221
replacement 25
Resolution 132
Resolution rule 328
Right contour 46
Right median incoming edge 260
Right-Heavy-HV-Tree-Draw 58
Right-pushed embedding 68
Rightmost path 95
Rigid frame 333
| Root 42
Rooted tree 42
Rooted tree, hv-drawing 56—59 316
Rooted tree, layered drawing 43—55
Rooted tree, planar straight-line strictly upward drawing 43—51
Rooted tree, planar straight-line strictly upward grid drawing 45
Rooted tree, planar straight-line upward grid drawing 60—64
Rooted tree, radial drawing 52—55
Rooted tree, terminology 42
Rotationally isomorphic 123
Rotationally symmetric 123
route 229
Row pair 240
S-node 66
Saturate-Face 185
Self-loop 3
Separating cycle 75
Separating pair 9
Series-parallel digraph 30 64
Series-parallel digraph, interactive drawing 219
Series-parallel digraph, planar straight-line strictly upward grid drawing 64—74
Series-parallel digraph, planar straight-line upward drawing 327
Series-parallel digraph, terminology 64
Series-parallel digraph, upward planar drawing 212
Shaft 333
SHAPE 20 141
Simple graph 3
Simply isomorphic 44 123
Simulated annealing 320
Single-source planar acyclic digraph upward planar drawing 192—200 209—210
Sink 4
Sink-switch 182
Skeleton 198
Social network 320
Source 4
Source-switch 182
span 269
Split 284
Split component 196
Split pair 196
SPQR-tree 198
Spring 305
Spring force 305
st-graph 89
st-numbering 128
Stiffness 308
Straight-line drawing 12
Straight-line drawing with bounded angular resolution, planar graph 327
Straight-line drawing, graph 29—30 305—309 312—324
Straight-line drawing, planar acyclic digraph 327—331
Straight-line drawing, planar clustered graph 327
Straight-line drawing, planar graph 132—134 309—312 335—338
Straight-line drawing, rooted tree 43—64
Straight-line drawing, series-parallel digraph 64—74 327
Straight-line drawing, tree 338
Strictly upward drawing 13
Strong-visibility representation 130
Subgraph 5 30
Subroutine-call graph 22
Subtree 42
switch 182
Switch-flow network 202
Symmetric drawing, graph 308
Symmetric subtree 30
Symmetry 45 49 59 72 121 123 126
System of forces 29
Taxonomy of classes of graphs 31
Tendril 201
Tessellation 97
Tessellation representation 85
Tessellation representation, planar graph 127—129
Tessellation representation, planar st-graph 96—99
Tidy-Rectangle-Compact 152
Tile 96
Topological numbering 89
Topological sorting 89
topology 19 23
Topology-shape-metrics approach 18—22 33
Transitive closure 4 112
Transitive edge 4 67
Transitive reduction 5
TREE 30 42 see "Free
Tree, grid drawing 339
Tree, interactive drawing 219
Tree, minimum spanning tree drawing 339
Tree, unit length planar straight-line grid drawing 338
Triangular grid 339
Triangulation drawing 28
Triconnected 29 31 130 191 192 196 198 205 206 311 328
Triconnected graph 9
Two-layer crossing problem 280 281 290
Two-layered digraph 281
Unassigned vertex 241
Underlying undirected graph 9
Uniquely drawable graph 336
Unit disk touching drawing, graph 339
Unit length grid drawing, tree 338
Unit length planar drawing, planar graph 335—338
Unit length planar drawing, tree 338
Unit length straight-line drawing, planar graph 335—338
Unit length straight-line drawing, tree 338
Upward drawing 13
Upward drawing, digraph 22—25 315
Upward drawing, ordered set 210—212
Upward drawing, outerplanar acyclic digraph 209
Upward drawing, planar acyclic digraph 172—210 327—331
Upward drawing, planar bipartite digraph 212
Upward drawing, planar st-graph 107—112 212
Upward drawing, rooted tree 43—51 56—64
Upward drawing, series-parallel digraph 64—74 212 327
Upward drawing, single-source planar acyclic digraph 192—200 209—210
Value of the flow 145
Vertex sequence 295
Vertex-angle 139
Vertex-segment 99
Vertical combination 56
Vertically adjacent 96
Visibility 25 100
Visibility approach 25—27 33
Visibility representation 25 85 99
Visibility representation, planar graph 127—132 165—168
Visibility representation, planar st-graph 99 112
Visible 85 175
Weakly connected 121
wedge 175
Weighted topological numbering 89
Weighted topological numbering, optimal 89 155
width 269
Wiggle 201
x-coordinate assignment 23
|
|
|
| Реклама |
|
|
|
|
|
О проекте