Algorithmic Aspects of Combinatorics

Front Cover
Elsevier, Oct 10, 2011 - Mathematics - 244 pages
0 Reviews
Algorithmic Aspects of Combinatorics
 

What people are saying - Write a review

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

Contents

Chapter 1 Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations ...
1
Chapter 2 Which spheres are shellable?
33
Chapter 3 A representation of 2dimensional pseudomanifolds and its use in the design of a lineartime shelling algorithm
53
Chapter 4 An analysis of the greedy heuristic for independence systems
65
Chapter 5 Sequencing jobs to minimize total weighted completion time subject to precedence constraints ...
75
Chapter 6 Subtree isomorphism in On52
91
Chapter 7 Every one a winner or How to avoid isomorphism search when cataloguing combinatorial configurations
107
Chapter 8 Complexity of monotone networks for computing conjunctions
121
Chapter 12 An inequality on binomial coefficients
155
Chapter 13 On the edgecoloring property for the closure of the complete hypergraphs
161
Chapter 14 Steiner trees for ladders
173
Chapter 15 Local unimodularity in the matching polytope
201
Chapter 16 The Dilworth number of a graph
211
Chapter 17 Biased positional games
221
Chapter 18 A characterization of pseudoaffine designs and their relation to a problem of Cordes ...
231
Chapter 19 Research Problems
239

Chapter 9 A unified setting for selection algorithms II
135
Chapter 10 Algorithms and extremal problems for equipartite colorings in graphs and hypergraphs abstract ...
149
Chapter 11 Two results concerning multicoloring
151
Between a rock and a hard place? abstract
245
Copyright

Common terms and phrases

Bibliographic information