Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs

Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

This paper considers enumeration of specific subgraphs of a given graph by using a data structure called a zero-suppressed binary decision diagram (ZDD). A ZDD can represent the set of solutions quite compactly. Recent studies have demonstrated that a technique generically called frontier-based search (FBS) is a powerful framework for using ZDDs to enumerate various yet rather simple types of subgraphs. We in this paper, propose colorful FBS, an enhancement of FBS, which enables us to enumerate more complex types of subgraphs than existing FBS techniques do. On the basis of colorful FBS, we design methods that construct ZDDs representing the sets of chordal and interval subgraphs from an input graph. Computer experiments show that the proposed methods run faster than reverse search based algorithms.

本文言語English
ホスト出版物のタイトルAnalysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers
編集者Ilias Kotsireas, Panos Pardalos, Arsenis Tsokas, Konstantinos E. Parsopoulos, Dimitris Souravlias
出版社Springer
ページ125-141
ページ数17
ISBN(印刷版)9783030340285
DOI
出版ステータスPublished - 2019 1 1
イベントSpecial Event on Analysis of Experimental Algorithms, SEA² 2019 - Kalamata, Greece
継続期間: 2019 6 242019 6 29

出版物シリーズ

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

Conference

ConferenceSpecial Event on Analysis of Experimental Algorithms, SEA² 2019
CountryGreece
CityKalamata
Period19/6/2419/6/29

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル