Sugiyama K. — Graph Drawing and Applications for Software and Knowledge Engineers :: Электронная библиотека попечительского совета мехмата МГУ

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

Авторизация

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

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.

Язык:

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

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

ed2k: ed2k stats

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

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

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

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID

Предметный указатель

2-connected component      23 812
2-layer graph      703
3-connected directed graph      293
3-connected planar graph      38
3-layer crossing problem      733
A priori importance      134
Abridgment fisheye mapping      140 141
Acyclic derived graph      110
Acyclic directed graph      8 27 61
Ada      163
Ada language grammatical structure      164 165
Adaptation to frame      87
Adjacency direct graph      103
Adjacency edge      8 103
Aesthetic criteria      7
Aesthetics      4
AI algorithm      17
Analysis of thought development history      178
ancestors      103
Animation      185
Application examples      149
Applications of automatic graph drawing methods      147
Assigned compound graph      110
Assignment of compound layers      106
Assignment of layers      63
Associative network      102
Attitude method      171
Attractive force      24 95
Automatic graph drawing methods      3
Automatic graph drawing methods at a glance      46 47
Automatic graph drawing problem      4
Automorphism      43
B-spline      30
Bad drawing      3
balance      50 75
Barycenter      70
Barycenter method      30 70
Basic types of diagram language      2
Bends      40
Bezier curve      131
Bi-directional magnetic spring      94
Binary tree      21
Bioinformatics      3
Bioinformatics model      17
Block      81
Browsing      149
Center      23
Chart making      172
Children      103
Circuit layout      4
Citation diagram      155 156
Classical convention      23
Classification of graphs      8
Classification of idea support methods      170
Closeness      60 75
Cognitive criteria      4
Column barycenter      71
Column barycenter ordering      71
Combinatorial problems      68
Compaction      43
Complete binary tree      26
Composite creativity support      171
Composite type diagram language      2
Compound coordinate system      9 10
Compound cycle      45 111
Compound directed graph      103
Compound graph      3 45 102
Compound graph drawing method      102
Compound graph metrical layout algorithm      120
Compound graph vertex order determination algorithm      115
Compound layer      106
Compound layer assignment      106 108
Compound layer assignment algorithm      109
Compound layer assignment possible      110
Compound magnetic field      94
Concentric circle drawing of hierarchical graphs      34
Concentric circle layout      23
Concentric circle placement      10
Concentric field      95
Conceptual graph      102
Constraint      11
Continuity of cognition      12
Control polygon      131
Controlling orientations of edges      91
Convergent method      171
Convex drawing      38
Convex polygon      38
Coordinate type diagram language      2
Correlation coefficient maximization method      71
Creativity machine intelligence      171
Creativity research      171
Creativity support      169
Crossing among outlines      34
Crossing minimization problem      68
Curve routing      10
Cut-point      82
Cycles      27
D-ABDUCTOR      148 169 179
da Vinci      148
Dag      148
data flow diagram      43
Decision of layout position      74
Degree of interest      134
Dense graph      44
Depth first search      62
Derived edge      110
Derived graph      110
descendants      103
Details of automatic graph drawing methods      49
Diagram      1
Diagram editor      5
Diagram language      2
Diagram language interface      1
Diagram matrix expression of the KJ method      174 175
Diagrammatic creativity support      147
Diagrammatic idea organizer      169 179
Diagrammatic thought (creativity) support      5 45
Diapophysis diagram      156
Direct manipulation interface      149
Directed edge      94
Directed graph drawing methods      27
Directed graphs      8
Directory browser      166
Divergent method      171
Divide and conquer approach      63
Divide and conquer method      32 33
Divide and conquer method (approach)      32 63
Documentation      148
Documentation support      148
Downward (upward) drawings      28
Downward (upward) pass      73
Drag      148
Drawing algorithm      16
Drawing convention      7 9 11
Drawing methods using curves      127
Drawing object      7
Drawing rules      7 11
Drawing style change function      178
Dual graph      84
Dummy adjacency edge      112
Dummy compound graphs      112
Dummy inclusion edge      112
Dummy vertex      64 66 112
Dynamic drawing method      142
Dynamic rule      11
Dynamical model      5
EDGE      148
Edge crossing minimization problem      30
Edge crossings      8
Edge length minimization      59

Edge rule      190
Edge span      59
Edge vertex crossings      104
Elasticity constant      89
Element of diagram      1
Emergent Media Environment      169
Empirical creativity methods      171
Energy      87 89
Entity relationship diagram      43
Evaluation of D-ABDUCTOR      188
Existential graph      102
Expert system      5
Extension of automatic graph drawing methods      127
F-hierarchy      157 158
Face      38
Facilities of D-ABDUCTOR      183
Features of D-ABDUCTOR      179
Features of drawing algorithms      7
Feedback edge      28
FishEye      134
Fisheye for Compound graphs      13 8
Fixed edge length      87
Flexible diagram editor      178
Force-directed method (layout)      24 42 87
Frameworks for automatic graph drawing      7
Free placement      10
Free tree      8 23
Gap dispersion      51
Garden drawing      25 27
GBD      148
General directed graph drawing      59
General directed graphs      8 35
General priority relationship      15 16
General tree drawing method      49
General trees      21
General undirected graph drawing method      81
General undirected graphs      37 42
Generalized fisheye      134
Generation of curves      131
Generic graph drawing method      91
Genetic algorithm      5 17
Geometrical barycenter      123
Geometrical inclusion      104 106
get      148
Giotto      148
Good drawing      3
Graph      3
Graph Browser      148
Graph editor      149
Graph theoretic distance      89
Graphical hypertext      166
Graphlet      148
Graphviz      148
Gravitational forces      43
Grid representation      86
Group rule      190
Groupware      5
h-layer graph      68 73
H-tree drawing      25 26
Haase diagram      27
Hand drawn closed curves      129
Hand drawn-like curves      131
Height minimization      63
Height of hierarchical graphs      63
Heuristic method      5
Heuristics      5
Hierarchical drawing      29
Hierarchical graph      29 63
Hierarchy      8
Higraph      102
Hooke's law      88
Horizontal format      23
Horizontal nested layer      106
Human interface      4
Human layout criteria      4 11
hybrid algorithm      17
Hypergraph      156
Idea support tool      149
Ideal distance      89
Identical drawing      21
Improved priority method      80
Incidence matrix      69 156
Inclusion convention      23
Inclusion directed graph      103
Inclusion edge      8 103
Inclusion tree      103
Incremental editing      184
Indegree      68
Inner face      38
Insertion barycenter method      117
Integer linear programming      84
Integration method      171
Interactive creativity support      170
Interindustry relation table      151
Internet      3
ISA hierarchy      27
Issue map      93
Kanji LCRM      190
KJ Method      45 102
Knowledge base      159
Knowledge structure diagram      162
Label grammar      190
Label grouping      172
Label making      172
Label rule      190
Labeled Construction-Rule Method (LCRM)      189
Language Simple      188
Layer assignment      108
Layer by layer strategy      73
layering      30
Layering to minimize the number of dummy vertices      67
Layout by example      17
Layout stability      142
Leaf      23
Least separation      75
Left child      53
Linear programming      30
Linearity      60
Linearity of long edge      76
Liner arrangement problem      116
List structure diagram      93
Local 2-layer graph      115
Local 2-layer graph vertex order determination      118
Local h-layer graph vertex order determination      119
Local hierarchy graph      113
Local multiplayer graph      113 114
Long edge      66
Longest path layering      64 65
Macro structure diagram of the Japanese economy      154
Magnetic field      93
Magnetic spring algorithm      93 96
Magnetic spring drawing method      91
Magnetic spring model      93
Magnetic springs      94
Mathematical model of mental map      144
Matrix realization      68
Matrix type diagram language      2
Maximal planar subgraph      82
Median      70
Median method      30 70
Medical diagnosis system EMYCIN      160
Mental map      11 144
Metric rules      16
Minimization of adjacency edge crossings      116
Minimization of bends      40 42
Minimization of drawing area      40
Minimization of edge crossing      42 59 68
Minimization of edge vertex crossings      113
Minimization of total line length      38 40 86
Minimum feedback arc set problem      30 37 61

1 2

О проекте