Computermethoden zur Lösung einiger konkreter kombinatorischer ...

84 Literaturverzeichnis
McKay 1998
MCKAY, B. D.: Isomorph-free exhaustive generation. In: Journal of Algorithms.
1998 (26 (1998)), S. 306–324
McKay u. Radziszowski 1995
MCKAY, B. D. ; RADZISZOWSKI, S.: R(4,5)=5. In: Journal of Graph Theory.
1995 (19 (1995)), S. 309–322 5, 16, 19, 32, 33, 34, 44
McKay u. Radziszowski 1992
MCKAY, B. D. ; RADZISZOWSKI, S. P.: A New Upper Bound for the Ramsey
Number R(5,5). In: Australian Journal of Combinatorics. 1992 (5 (1992)), S.
13–20
McKay u. Radziszowski 1994
MCKAY, B. D. ; RADZISZOWSKI, S. P.: Linear Programming in Some Ramsey
Problems. In: Journal of Combinatorial Theory, Series B. 1994 (61 (1994)) 32,
33
McKay u. Zhang Ke Min 1992
MCKAY, B. D. ; ZHANG KE MIN: The Value of the Ramsey Number R(3,8). In:
Journal of Graph Theory. 1992 (16 (1992)), S. 99–105 4, 16, 19, 28, 29, 33, 34
McMullin 1970
MCMULLIN, P.: The maximum number of faces of a convex polytope. In: Mathematika.
1970 (17, (1970)), S. 179–184 53
Meisinger u. a. 2000
MEISINGER, G. ; KLEINSCHMIDT, P. ; KALAI, G.: Some aspects of the combinatorial
theory of convex polytopes. In: Discrete and Computational Geometry.
2000 (24, (2000)), S. 413–420
Motzkin 1957
MOTZKIN, T. S.: Comonotone curves and polyhedra. In: Bulletin Amer. Math.
Soc. 1957 (63, (1957)), S. 35 53
Mulmuley 1994
MULMULEY, K.: Computational Geometry. Englewood Cliffs, New Jersey 07632
: Prentice-Hall, Inc., 1994
Nadef 1989
NADEF, D.: The Hirsch conjecture is true fo (0,1)-polytopes. In: Mathematical
Programming. 1989 (45, (1989)), S. 109–110 53
Nievergelt 2000
NIEVERGELT, J.: Exhaustive Search, Combinatorial Optimization and Enumeration:
Exploring the Potential of Raw Computing Power. In: Lecture Note in
Computer Science (LCNS) 1963. 2000 ((2000)), S. 18–35 5