On totally unimodularity of edge-edge adjacency matrices

Yusuke Matsumoto, Naoyuki Kamiyama, Keiko Imai

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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.

本文言語英語
ホスト出版物のタイトルComputing and Combinatorics - 17th Annual International Conference, COCOON 2011, Proceedings
ページ354-365
ページ数12
DOI
出版ステータス出版済み - 2011
外部発表はい
イベント17th Annual International Computing and Combinatorics Conference, COCOON 2011 - Dallas, TX, 米国
継続期間: 8 14 20118 16 2011

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6842 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他17th Annual International Computing and Combinatorics Conference, COCOON 2011
国/地域米国
CityDallas, TX
Period8/14/118/16/11

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「On totally unimodularity of edge-edge adjacency matrices」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル