Algorithmic Aspects Of Combinatorics, Volume 2 (annals Of Discrete Mathematics)

Content: Managing Editor Page ii Edited by Page iii Copyright page Page iv Introduction Pages v-vi Brian Alspach, Pavol Hell, Donald J. Miller Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations Original Research Article Pages 1-32 D.G. Corneil, R.A. Mathon Which Spheres are Shellable? Original Research Article Pages 33-52 Gopal Danaraj, Victor Klee A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm Original Research Article Pages 53-63 Gopal Danaraj, Victor Klee An Analysis of the Greedy Heuristic for Independence Systems Original Research Article Pages 65-74 Bernhard Korte, Dirk Hausmann Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints Original Research Article Pages 75-90 E.L. Lawler Subtree Isomorphism in O(n 5/2 ) Original Research Article Pages 91-106 David W. Matula Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations Original Research Article Pages 107-120 Ronald C. Read Complexity of Monotone Networks for Computing Conjunctions Original Research Article Pages 121-133 Robert Endre Tarjan A Unified Setting for Selection Algorithms (II) Original Research Article Pages 135-148 Herbert S. Wilf Abstract: Algorithms and Extremal Problems for Equipartite Colorings in Graphs and Hypergraphs Original Research Article Pages 149-150 Claude Berge Two Results Concerning Multicoloring Original Research Article Pages 151-154 V. Chvácutetal, M.R. Garey, D.S. Johnson An Inequality on Binomial Coefficients Original Research Article Pages 155-159 Ellis L. Johnson, Donald Newman, Kenneth Winston On the Edge-Coloring Property for the Closure of the Complete Hypergraphs Original Research Article Pages 161-171 Ellis L. Johnson Steiner Trees for Ladders Original Research Article Pages 173-200 F.R.K. Chung, R.L. Graham Local Unimodularity in the Matching Polytope Original Research Article Pages 201-209 A.J. Hoffman, Rosa Oppenheim The Dilworth Number of a Graph Original Research Article Pages 211-219 Stéphane Foldes, Peter L. Hammer Biased Positional Games Original Research Article Pages 221-229 V. Chvátal, P. Erdös A characterization of Pseudo-Affine Designs and their Relation to a Problem of Cordes Original Research Article Pages 231-238 R.C. Mullin, R.G. Stanton Research Problems Pages 239-243 Abstract of Talk: Graph Coloring Algorithm: Between a Rock and a Hard Place? Original Research Article Page 245 David S. Johnson In recent years there has been an extensive increase in research on both the design and analysis of algorithms for various combinatorial structures. Contributions have come from people in fields such as mathematics, computing science, electrical engineering, and others. There are often problems with dialogue between people working in different fields, the editors organized a conference devoted to looking at algorithms for combinatorial structures, and invited leading experts in several areas to focus their attention on algorithms for combinatorial structures. This volume presents those papers, which includes a great amount of new research