## Congressus Numerantium, Volume 134 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### 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

4-cycles A-colorable abelian group accepting class adjacency matrix algorithm arcs artificial edge assume bicomponents bipartite graph bipermutational TSR cell characteristic polynomial complete binary tree Computer connected graph contains Corollary corresponding cycle of f d(vj decomposition tree decycling set defined denote the set digraph disjoint distance dual dummy node elements embedding endif exactly exists exponential sums Figure finite folded n-cube function Gaussian sum general-series-parallel graph G graph problems Graph Theory greatest common subgraph halfcycle homomorphic classes hypercube induced subgraph induction integer it-terminal LCST leaf Lemma Let G link edges loop Math minimum node q non-graph problems NP-Complete number of edges obtain odd cycle operation P-position pair parallel parity partite pattern player takes points polynomial predicates processors Proof recursively decomposable result root series-parallel graphs set of homomorphic SHORTEST COMMON SUPERSTRING shortest path small cyclic snake strict-series-parallel subBTSR of G subpaths subset terminal Theory vector vertices of G Z-Cube