Proceedings of the WG '83: International Workshop on Graphtheoretic Concepts in Computer Science, June 16-18, 1983, Osnabrück, Fed. Rep. Germany
Trauner, 1983 - Computer algorithms - 397 pages
2 pages matching polyomino in this book
Results 1-2 of 2
What people are saying - Write a review
We haven't found any reviews in the usual places.
algorithm array attributes B-trees BB[a binary cells circuit color column tree complete complete graph components Computer Science configuration connected constraints convex polygons corresponding cycle data types database decomposition defined definition denote derivation process development histories edges efficient elements embedding example exists fanout Figure finite flow graph languages forbidden structures function given graph G grid file heuristic hypergraph implementation input inserting intersection inverted file labels lattice layout Lemma length linear locus approach logn mesh of trees minimal nodes NP-complete NUNLC grammars optimal outerplanar graph parallel periodic skewing scheme planar graphs polygons polynomial polyomino Proc production proof PSPACE-complete query random random graphs rectangle relation resp searching problem sequence shortest path simulate SLAP space steps stored system of forbidden Theorem tion transformation unidirectional search values vertex vertex cover problem vertices VLSI wire