Testing orientability for matroids is NP-complete
From MaRDI portal
Publication:1809523
DOI10.1006/aama.1999.0648zbMath0934.05039MaRDI QIDQ1809523
Publication date: 10 April 2000
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/30231608695537580e5bd218d9d41be1941dd142
68Q25: Analysis of algorithms and problem complexity
52B40: Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.)
05B35: Combinatorial aspects of matroids and geometric lattices
Related Items
Weak orientability of matroids and polynomial equations, Matroid enumeration for incidence geometry, Combinatorial polar orderings and recursively orderable arrangements, Minimal non-orientable matroids in a projective plane, On minimal non-orientable matroids with \(2n\) elements and rank \(n\), Diameters of cocircuit graphs of oriented matroids: an update
Cites Work