Recognizing binet matrices
From MaRDI portal
Publication:2638382
DOI10.1007/s10107-010-0372-8zbMath1206.68149OpenAlexW1984494990MaRDI QIDQ2638382
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0372-8
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New polynomial-time algorithms for Camion bases
- Matrices with the Edmonds-Johnson property
- A short proof of Tutte's characterization of totally unimodular matrices
- Simplicial cells in arrangements of hyperplanes
- Decomposition of regular matroids
- Signed graphs
- On the complexity of testing for odd holes and induced odd paths
- Orientation of signed graphs
- Disjoint homotopic paths and trees in a planar graph
- Kuratowski's and Wagner's theorems for matroids
- Recent work in matroid representation theory
- Orientation of matrices
- Graphs and Vector Spaces
- An Algorithm for Determining Whether a Given Binary Matroid is Graphic
- An Almost Linear-Time Algorithm for Graph Realization
- Converting Linear Programs to Network Problems
- A bidirected generalization of network matrices
- A simple algorithm that proves half‐integrality of bidirected network programming
- Maximum matching and a polyhedron with 0,1-vertices
- Lectures on matroids
- On even matroids
- Modules unimodulaires
