On listing, sampling, and counting the chordal graphs with edge constraints

Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno

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

4 引用 (Scopus)

抜粋

We discuss the problems to list, sample, and count the chordal graphs with edge constraints. The objects we look at are chordal graphs sandwiched by a given pair of graphs where we assume at least one of the input pair is chordal. The setting is a natural generalization of chordal completions and deletions. For the listing problem, we give an efficient algorithm running in polynomial time per output with polynomial space. As for the sampling problem, we give two clues that seem to imply that a random sampling is not easy. The first clue is that we show #P-completeness results for counting problems. The second clue is that we give an instance for which a natural Markov chain suffers from an exponential mixing time. These results provide a unified viewpoint from algorithms theory to problems arising from various areas such as statistics, data mining, and numerical computation.

元の言語英語
ホスト出版物のタイトルComputing and Combinatorics - 14th Annual International Conference, COCOON 2008, Proceedings
ページ458-467
ページ数10
DOI
出版物ステータス出版済み - 8 4 2008
外部発表Yes
イベント14th Annual International Conference on Computing and Combinatorics, COCOON 2008 - Dalian, 中国
継続期間: 6 27 20086 29 2008

出版物シリーズ

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

その他

その他14th Annual International Conference on Computing and Combinatorics, COCOON 2008
中国
Dalian
期間6/27/086/29/08

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント On listing, sampling, and counting the chordal graphs with edge constraints' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Kijima, S., Kiyomi, M., Okamoto, Y., & Uno, T. (2008). On listing, sampling, and counting the chordal graphs with edge constraints. : Computing and Combinatorics - 14th Annual International Conference, COCOON 2008, Proceedings (pp. 458-467). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5092 LNCS). https://doi.org/10.1007/978-3-540-69733-6_45