E-Books durchsuchen

Graph-Theoretic Concepts in Computer Science [1989]

1
NC-algorithms for graphs with small treewidth
11
Graph-theoretic properties compatible with graph derivations
30
The monadic second-order logic of graphs : Definable sets of finite graphs
54
On systems of equations defining infinite graphs
74
Fault tolerant networks of specified diameter
87
DFS tree construction: Algorithms and characterizations
107
Serializable graphs
122
Transitive closure algorithms for very large databases
148
A graph-based decomposition approach for recursive query processing
166
Construction of deterministic transition graphs from dynamic integrity constraints
180
(Time × space)-efficient implementations of hlerarchical conceptual models
190
Dominance in the presence of obstacles
202
Separating a polyhedron by one translation from a set of obstacles
213
Linear time algorithms for testing approximate congruence in the plane
229
Moving regular <Emphasis Type="Italic">k</Emphasis>-gons in contact
243
Epsilon-nets for halfplanes
253
Greedy triangulation can be efficiently implemented in the average case
262
A simple systolic method to find all bridges of an undirected graph
268
Colouring perfect planar graphs in parallel
276
An efficient parallel algorithm for the all pairs shortest path problem
288
A parallel algorithm for channel routing
304
Application of graph theory to topology generation for logic gates
317
On the estimate of the size of a directed graph
327
The average size of ordered binary subgraphs
352
O(n<Superscript>2</Superscript>) algorithms for graph planarization
378
Bandwidth and profile minimization
394
On the spanning trees of weighted graphs
406
On paths in search or decision trees which require almost worst-case time
424
A time-optimal parallel algorithm for the computing of Voronoi-diagrams
434
Voronoi diagrams in the moscow metric
442
A sweep algorithm and its implementation: The all-nearest-neighbors problem revisited
Feedback