Algorithms and Computation: ... International Symposium, ISAAC ... : ProceedingsSpringer-Verlag, 1993 - Computer algorithms |
Contents
SESSION | 1 |
Remembering Conflicts in History Yields Dynamic Algorithms | 21 |
Graphical Degree Sequence Problems with Connectivity Requirements | 38 |
Copyright | |
33 other sections not shown
Other editions - View all
Common terms and phrases
approximation assume b₁ bd(P BDD's Boolean function boundary branching programs called cograph complexity Computational Geometry Computer Science connected consider constant constructed contains convex corresponding cost counterclockwise data structure defined degree sequence delete denote dynamic edge exists given gossiping graph G heap Hence hypercube input integer intersection interval interval graph Knapsack problem Lemma length linear longest wire lower bound matroid maximum merge minimal minimum node non-crossing paths NP-complete NP-hard O(log O(n² obtained optimal packets pair paper parallel partition phase planar graphs polynomial polynomial-time probabilistic problem Proc processor Proof query random randomized algorithm rectilinear recursive region request resp shortest path shortest watchman route simple polygon solved spanner step subheap subset Subset Sum problem terminals Theorem tree treewidth update upper bound v₁ variables vertex vertices watchman route problem weakly visible weight