Abstract
This paper describes a backtracking algorithm for the enumeration of nonisomorphic minimally nonideal (n ×n) matrices that are not degenerate projective planes. The application of this algorithm forn ≤ 12 yielded 20 such matrices, adding 5 matrices to the 15 previously known. For greater dimensions,n = 14 andn = 17, 13 new matrices are given. For nonsquare matrices, 38 new minimally nonindeal matrices are described.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cornuejols G, Novick B (1994) Ideal 0, 1 matrices. J. Comb. Theory Ser. B 60:145–157
Ding G (1993) Clutters with τ2 = 2 · τ. Discr. Math. 115:141–152
Fukuda K “cdd.c”: A C code for enumerating vertices and extreme rays. Available by anonymous ftp from iforl3.ethz.ch, directory pub/fukuda/cdd.
Fukuda K (1995) Private communication.
Fukuda K, Matsui T (1994) Finding all the perfect matchings in bipartite graphs. Appl. Math. Lett. 7:15–18
Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman
Johnson DS (1982) The NP-completness column, an ongoing guide. J. Algorithms 3:288–300
Lehman A (1979) On the width-length inequality. Mimeographic notes (1965), Math. Progr. 17: 403–417
Lehman A (1990) On the width-length inequality and degenerate projective planes. In: Cook W, Seymour PD (eds.) Polyhedral Combinatorics. DIMACS series in Discrete Mathematics and Computer Science, vol. 1, Amer. Math. Soc., pp. 101–105
Luks EM (1980) Isomorphism of bounded valence can be tested in polynomial time. Proc. FOCS 21:42–49
McKay BD (1996) Isomorphism-free exhaustive generation. Research report, Australian National University, Canberra
Nemhauser G, Wolsey L (1988) Integer and combinatorial optimization. Wiley
Novick B (1990) Ideal 0,1 matrices. Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA
Padberg MW (1993) Lehman's forbidden minor characterization of ideal 0–1 matrices. Discr. Math. 111:409–420
Qi L (1989) On the set covering polytope and the MFMC-clutter. School of Mathematics, University of South Wales
Read RC (1981) A survey of graph generation techniques. In: Combinatorial Mathematics VIII, Lecture Notes in Mathematics 884, Springer, pp. 77–89
Seymour PD (1977) The matroids with the max-flow min-cut property. J. Comb. Theory Ser. B 23:189–222
Seymour PD (1990) On Lehman's width-length characterization. In: Cook W, Seymour PD (eds.) Polyhedral Combinatorics. DIMACS series in Discrete Mathematics and Computer Science, vol. 1, Amer. Math. Soc., pp. 107–117
Valiant LG (1979) The complexity of enumeration and reliability problems. SIAM J. Comput. 8:410–421
Author information
Authors and Affiliations
Additional information
Research supported by FNRS grant. Switzerland, while visiting Carnegie Mellon University, Pittsburgh, PA 15213.
Rights and permissions
About this article
Cite this article
Lütolf, C., Margot, F. A catalog of minimally nonideal matrices. Mathematical Methods of Operations Research 47, 221–241 (1998). https://doi.org/10.1007/BF01194398
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01194398