Skip to main content
Conference Proceedings

On totally unimodularity of edge-edge adjacency matrices

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6842 LNCS 354-365
DOI: 10.1007/978-3-642-22685-4_32
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider totally unimodularity for edge-edge adjacency matrices which represent a relationship between two edges in a graph. The matrices appear in integer programming formulations for the minimum maximal matching problem and the edge dominating set problem. We consider a problem of characterizing graphs having totally unimodular matrices as their edge-edge adjacency matrices, and give a necessary and sufficient condition for the characterization. The condition is the first characterization for edge-edge adjacency matrices. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Matsumoto, Y., Kamiyama, N., & Imai, K. (2011). On totally unimodularity of edge-edge adjacency matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6842 LNCS, pp. 354–365). https://doi.org/10.1007/978-3-642-22685-4_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free