×

Algorithmic aspects of combinatorics. (English) Zbl 0372.00006

Annals of Discrete Mathematics 2. Amsterdam-New York-Oxford: North-Holland Publishing Company. VII, 245 p. (1978).

Show indexed articles as search result.

The articles of this volume will be reviewed individually.
Indexed articles:
Corneil, D. G.; Mathon, R. A., Algorithmic techniques for the generation and analysis of strongly regular graphs and other combinatorial configurations, 1-32 [Zbl 0398.05054]
Danaraj, Gopal; Klee, Victor, Which spheres are shellable?, 33-52 [Zbl 0401.57031]
Danaraj, Gopal; Klee, Victor, A representation of 2-dimensional pseudomanifolds and its use in the design of a linear-time shelling algorithm, 53-63 [Zbl 0391.57008]
Korte, Bernhard; Hausmann, Dirk, An analysis of the greedy heuristic for independence systems, 65-74 [Zbl 0392.90058]
Lawler, E. L., Sequencing jobs to minimize total weighted completion time subject to precedence constraints, 75-90 [Zbl 0374.68033]
Matula, David W., Subtree isomorphism in \(0(n^{5/2})\), 91-106 [Zbl 0391.05022]
Read, Ronald C., Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations, 107-120 [Zbl 0392.05001]
Tarjan, Robert Endre, Complexity of monotone networks for computing conjunctions, 121-133 [Zbl 0383.94038]
Wilf, Herbert S., A unified setting for selection algorithms (II), 135-148 [Zbl 0422.05043]
Berge, Claude, Algorithms and extremal problems for equipartite colorings in graphs and hypergraphs, 149-150 [Zbl 0419.05040]
Chvatal, V.; Garey, M. R.; Johnson, D. S., Two results concerning multicoloring, 151-154 [Zbl 0374.05025]
Johnson, Ellis L.; Newman, Donald; Winston, Kenneth, An inequality on binomial coefficients, 155-159 [Zbl 0391.05001]
Johnson, Ellis L., On the edge-coloring property for the closure of the complete hypergraphs, 161-171 [Zbl 0393.05009]
Chung, F. R. K.; Graham, R. L., Steiner trees for ladders, 173-200 [Zbl 0384.05030]
Hoffman, A. J.; Oppenheim, Rosa, Local unimodularity in the matching polytope, 201-209 [Zbl 0398.90064]
Foldes, Stephane; Hammer, Peter L., The Dilworth number of a graph, 211-219 [Zbl 0389.05048]
Chvatal, V.; Erdős, Paul, Biased positional games, 221-229 [Zbl 0374.90086]
Mullin, R. C.; Stanton, R. G., A characterization of pseudo-affine designs and their relation to a problem of Cordes, 231-238 [Zbl 0374.05007]

MSC:

00Bxx Conference proceedings and collections of articles
68W99 Algorithms in computer science
05-06 Proceedings, conferences, collections, etc. pertaining to combinatorics