抄録
We consider total unimodularity for edge-edge adjacency matrices that represent adjacency relations between pairs of edges in a graph. These matrices appear in integer programming formulations of the minimum maximal matching problem, the edge dominating set problem, and so on. We investigate the problem of characterizing graphs that have totally unimodular edge-edge adjacency matrices, and give a necessary and sufficient condition for characterization. This condition is the first characterization for total unimodularity of edge-edge adjacency matrices.
| 本文言語 | 英語 |
|---|---|
| ページ（範囲） | 277-292 |
| ページ数 | 16 |
| ジャーナル | Algorithmica |
| 巻 | 67 |
| 号 | 2 |
| DOI | |
| 出版ステータス | 出版済み - 10 1 2013 |
All Science Journal Classification (ASJC) codes
- コンピュータ サイエンス（全般）
- コンピュータ サイエンスの応用
- 応用数学