Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Sugiyama K. — Graph Drawing and Applications for Software and Knowledge Engineers
Sugiyama K. — Graph Drawing and Applications for Software and Knowledge Engineers



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Graph Drawing and Applications for Software and Knowledge Engineers

Автор: Sugiyama K.

Аннотация:

This book is useful for readers who want to visualize graphs as representing structural knowledge in a variety of fields. It gives an outline of the whole field, describes in detail the representative methods for drawing graphs, explains extensions such as fisheye and dynamic drawing, presents many practical applications, and discusses ways of evaluation. It makes the intuitive understanding of these easier by using examples and diagrams, and provides a wealth of references for those readers who wish to know more.


Язык: en

Рубрика: Технология/

Статус предметного указателя: Готов указатель с номерами страниц

ed2k: ed2k stats

Год издания: 2002

Количество страниц: 218

Добавлена в каталог: 16.11.2009

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
Minimum width      20 50
Mixed graph      91
Model that preserve cluster      144
Model that preserves the relationship of 8 directions      144
Model that preserves topology      144
Monitoring      148
Monotone drawing      27
Multi-layer graph      73
Multimedia      169
Multiple edges      8
Natural fisheye mapping      136
Nested hierarchy      104 110
Net type diagram language      2
Network flow technique      40
Network Monitor      166
Non-planar graph      38
normal      112
Normal compound graph      112
Normal orthogolization      84
Normalization      30 84
Normalization of assigned compound graph      112
Number of crossings      69
Offset      131
Online Force-Directed Animated Visualization (OFTAV)      145
Optimum embedding      4
Ordered binary tree      21
Ordered compound graph      113 114
organization chart      3
Original edge      110
Orthogonal grid drawing      39 43
Orthogonal grid placement      10 25
Orthogonal order model      144
Orthogonal representation      84
Orthogonal representation with few bends      86
Orthogonalization      43
Outdegree      63 68
Outer face      38 82
Parallel field      95
Parallel line placement      10
Parent      103
PERT graph      27
Placement convention      10
Placement of vertices      9
Planar drawing      27
Planar graph      8 37
Planar monotone drawing      27
Planar orthogonal grid drawing      40
Planar representation      81 82
Planar straight line orthogonal grid drawing      39
Planarity      38
Planarity testing algorithm      38
Planarization      43 81
Platform for graph drawing      145
Polar field      95
Polar grid placement      10
Polyline routing      10
Postorder search      50 53
Predator-prey ecosystem      150
Preorder search      50 58
Priority      77
Priority layout method      30 77
Priority relationship      7
Proper hierarchical graph      68
Q-Analysis      156
Q-hierarchy      157 158
Quadratic Programming (QP) method      75
Quasi-Manhattan layout method      80
Radial line placement      10
readability      4
rectangle      104
Recurrent drawing      36 37
Recursive traversal      105
Reference structure between modules      163
Region type diagram language      2
Regular polygon      38
Representative vertex      103
Repulsive force      25 95
Retention fisheye mapping      138
Right child      53
Rings      87 93
Root      8
Rooted tree      8 20
Rotative force      95
Routing convention      10
Routing of edges      9
Row (column) barycenter      71
Row (column) barycenter ordering      71
Rules for normalization      85
Self loop      7
Semantic importance      135
Semantic rules      12
Semicircle drawing      41
Shape rules      16
Shortest path      89
Sibling separation      51
Sibling vertices      51
Simple directed graph      59
Simple graph      7
Simple LCRM      190
Simple local multiplayer graph      113 114
Simplicial complex      156
Simulated annealing      5 17 91
Skeletal diagram      156
Smallest energy state of system      87
sources      64
Space complexity      38
Span of edge      63
Spatial arrangement      172
Spread of creativity support research      171
Spring embedder      43
springs      88 93
Sprit method      116
Standard coordinate system      10
Standard magnetic field      94
Static drawing method      142
Static rules      11
Straight line convex drawing      39
Straight line drawing      38 42
Straight line routing      10
Strongly (strictly) connected component      35 62 110
Structural diagram of a food chain      150
Structural diagrams of Ada syntax      164 165
Structural importance      135
Structural rules      12
Structure analyzer      166
STT method      30
Subroutine call graph      27 163
Subtree separation      51
Switching method      71
Symmetrical drawing      21
Symmetry      21 42 50 87
Syntactic grammar      1
Text mining      167
Thermodynamics model      17
Thought guide      177
Tip-over convention      23
Title making      172
Topological rules      16
Topological sort      64 110
Total energy      89
Total importance      135
Transitive edge      64
TREE      8
Tree drawing methods      19
Tree search      50
Underlying undirected graph      27
Undirected edge      94
Undirected graph      8
Undirected graph drawing methods      37
Unidirectional magnetic spring      95
Uniform distribution      63
Uniform distribution of vertices      42 59
Uniform edge length      42
Uniform width layering      65 66
Unique vertex labeling      61
Upward (downward) drawing      28
Upward (downward) edge      61
Upward (downward) pass      73
User-friendly interface      1
VCG      148
Verbal of written explanation      173
Vertex      9
Vertex location determination      30
Vertex order determination      30
Vertical format      23
Vicinity radius      142
View importance      135
Virtual physical system      92
Visibility      40
Visibility representation      1 40 41
visual interface      1
Visual Q-Analysis      156
VLSI layout      91
Width minimization      50
Width of hierarchical graphs      63
1 2
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2024
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте