Congressus Numerantium, Volume 134Utilitas Mathematica Pub. Incorporated, 1998 - Combinatorial analysis |
Contents
A Shortest Path Algorithm for Ladder Networks by Yoshihiro Kaneko | 5 |
by Stephen E Shauger | 61 |
Decycling Snakes by Sheng Bau Lowell Beineke and Robert Vandell | 79 |
Copyright | |
6 other sections not shown
Other editions - View all
Common terms and phrases
2-cycle abelian group accepting class adjacency matrix algorithm arcs artificial edge assume B₁ bicomponents bipermutational TSR bound BTSR C(G₁ C₁ cell characteristic polynomial complete binary tree Computer connected graph contains Corollary corresponding decomposition tree decycling set defined denote the set digraph Dijkstra's algorithm disjoint distance dual dummy node elements embedding endif exactly exists Exponential Sums Figure finite function G₁ and G₂ Gaussian sum general-series-parallel graph G Graph Theory greatest common subgraph H₁ halfcycle homomorphic classes hypercube I2ro induced subgraph induction integer intersecting joined k-terminal decomposition leaf Lemma length Let G let H link edges Math minimum node q non-graph problems NP-Complete O(log odd cycle operation P-position pair parallel parity partite pattern player takes points polynomial predicates processors Proof result root series-parallel graphs set of homomorphic shortest path snake strict-series-parallel subBTSR of G subpaths subset T₁ terminal V(H₁ V₁ V₂ Z-Cube Zn