On total unimodularity of edge-edge adjacency matrices

DOI10.1007/s00453-013-9804-1zbMath1274.90321OpenAlexW2095011965MaRDI QIDQ378224

Naoyuki Kamiyama, Keiko Imai, Yusuke Matsumoto

Publication date: 11 November 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9804-1

zbMATH Keywords

graph theorytotal unimodularity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

The \(k\)-regular induced subgraph problem ⋮ Maximal matching polytope in trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Erratum to: ``Linear time algorithms for generalized edge dominating set problems
• Linear time algorithms for generalized edge dominating set problems
• Edge Dominating Sets in Graphs
• Trees with Hamiltonian square
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: On total unimodularity of edge-edge adjacency matrices