Algorithm Theory -- SWAT ...: Scandinavian Workshop on Algorithm Theory ... : ProceedingsSpringer-Verlag, 1994 - Algorithms |
From inside the book
Results 1-3 of 7
Page 172
... Canada , N2L 3G1 . email : nishi@plg.uwaterloo.ca , FAX ( 519 ) 885-1208 . Research supported by the Natural Sciences and Engineering Research Council of Canada . partial k - trees , subgraph isomorphism and topological embedding.
... Canada , N2L 3G1 . email : nishi@plg.uwaterloo.ca , FAX ( 519 ) 885-1208 . Research supported by the Natural Sciences and Engineering Research Council of Canada . partial k - trees , subgraph isomorphism and topological embedding.
Page 173
... topological embedding algorithms , parallel subgraph isomorphism algorithms , and ultimately parallel topological embedding algorithms . The outline of the remainder of the paper is as follows . In the next section we give definitions ...
... topological embedding algorithms , parallel subgraph isomorphism algorithms , and ultimately parallel topological embedding algorithms . The outline of the remainder of the paper is as follows . In the next section we give definitions ...
Page 177
... embedded in H , in the case of the topological embedding problem . Finally , each algorithm proceeds by processing the nodes of TH from bottom to top , at each point determining for each tdg - vertex in TDG ( G ) whether there is a tdg ...
... embedded in H , in the case of the topological embedding problem . Finally , each algorithm proceeds by processing the nodes of TH from bottom to top , at each point determining for each tdg - vertex in TDG ( G ) whether there is a tdg ...
Contents
Computing Depth Orders and Related Problems | 1 |
New OnLine Algorithms for the Page Replication Problem | 25 |
A New Algorithm for the Construction of Optimal BTrees | 49 |
Copyright | |
5 other sections not shown
Other editions - View all
Algorithm Theory - SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory ... Torben Hagerup,Jyrki Katajainen No preview available - 2004 |
Algorithm Theory - SWAT'98: 6th Scandinavian Workshop on Algorithm Theory ... Stefan Arnborg,Lars Ivansson No preview available - 1998 |
Common terms and phrases
array assume B₁ binary binary space partition boundary cell probe model chain clock complexity components Computational Geometry Computer Science consider constant construct contains convex polygon corresponding cost data structure defined denote disjoint distance-hereditary graph edge edge-coloring element envelope given graph G half-spaces Hence histogram independent set input intersection interval label Lemma length line segments linear log₂ lower bound lowest common ancestor LT-RAM machine maximal maximum memory minimum node NP-complete O(log O(n log O(n² objects obtain on-line algorithm optimal solution pair parallel algorithms partial k-tree partition path planar graph plane polynomial preprocessing problem Proc processors Proof query r-dominating clique random ratio rectilinear polygon recursively request resp S₁ scheduling separating triangles sequence simple polygon solved space steps subgraph subtree superstring techniques Theorem topological embedding translates tree tree-decomposition vertex vertices Voronoi diagram weakly-visible chords weighted