UID:
almahu_9949697788702882
Format:
1 online resource (255 p.)
ISBN:
1-281-77762-5
,
9786611777623
,
0-08-086765-0
Series Statement:
Annals of discrete mathematics ; 2
Content:
Algorithmic aspects of combinatorics
Note:
Description based upon print version of record.
,
Front Cover; Algorithmic Aspects of Combinatorics; Copyright Page; Contents; Introduction; Chapter 1. Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations; Chapter 2. Which spheres are shellable?; Chapter 3. A representation of 2-dimensional pseudo-manifolds and its use in the design of a linear-time shelling algorithm; Chapter 4. An analysis of the greedy heuristic for independence systems; Chapter 5. Sequencing jobs to minimize total weighted completion time subject to precedence constraints
,
Chapter 6. Subtree isomorphism in O(n5/2)Chapter 7. Every one a winner - or - How to avoid isomorphism search when cataloguing combinatorial configurations; Chapter 8. Complexity of monotone networks for computing conjunctions; Chapter 9. A unified setting for selection algorithms (II); Chapter 10. Algorithms and extremal problems for equipartite colorings in graphs and hypergraphs (abstract); Chapter 11. Two results concerning multicoloring; Chapter 12. An inequality on binomial coefficients; Chapter 13. On the edge-coloring property for the closure of the complete hypergraphs
,
Chapter 14. Steiner trees for laddersChapter 15. Local unimodularity in the matching polytope; Chapter 16. The Dilworth number of a graph; Chapter 17. Biased positional games; Chapter 18. A characterization of pseudo-affine designs and their relation to a problem of Cordes; Chapter 19. Research Problems; Chapter 20. Graph coloring algorithm: Between a rock and a hard place? (abstract)
,
English
Additional Edition:
ISBN 0-7204-1043-6
Language:
English
