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

Jun Kawahara; Toshiki Saitoh; Hirofumi Suzuki; Ryo Yoshinaka

doi:10.1007/978-3-030-34029-2_9

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

Jun Kawahara, Toshiki Saitoh, Hirofumi Suzuki, Ryo Yoshinaka

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

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.

Original language	English
Title of host publication	Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers
Editors	Ilias Kotsireas, Panos Pardalos, Arsenis Tsokas, Konstantinos E. Parsopoulos, Dimitris Souravlias
Publisher	Springer
Pages	125-141
Number of pages	17
ISBN (Print)	9783030340285
DOIs	https://doi.org/10.1007/978-3-030-34029-2_9
Publication status	Published - 2019 Jan 1
Event	Special Event on Analysis of Experimental Algorithms, SEA² 2019 - Kalamata, Greece Duration: 2019 Jun 24 → 2019 Jun 29

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11544 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	Special Event on Analysis of Experimental Algorithms, SEA² 2019
Country	Greece
City	Kalamata
Period	19/6/24 → 19/6/29

Keywords

Chordal graph
Decision diagram
Frontier-based search
Graph algorithm
Graph enumeration
Interval graph

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-030-34029-2_9

Fingerprint Dive into the research topics of 'Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs'. Together they form a unique fingerprint.

Cite this

Kawahara, J., Saitoh, T., Suzuki, H., & Yoshinaka, R. (2019). Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. In I. Kotsireas, P. Pardalos, A. Tsokas, K. E. Parsopoulos, & D. Souravlias (Eds.), Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers (pp. 125-141). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11544 LNCS). Springer. https://doi.org/10.1007/978-3-030-34029-2_9

Colorful Frontier-Based Search : Implicit Enumeration of Chordal and Interval Subgraphs. / Kawahara, Jun; Saitoh, Toshiki; Suzuki, Hirofumi; Yoshinaka, Ryo.

Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers. ed. / Ilias Kotsireas; Panos Pardalos; Arsenis Tsokas; Konstantinos E. Parsopoulos; Dimitris Souravlias. Springer, 2019. p. 125-141 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11544 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kawahara, J, Saitoh, T, Suzuki, H & Yoshinaka, R 2019, Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. in I Kotsireas, P Pardalos, A Tsokas, KE Parsopoulos & D Souravlias (eds), Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11544 LNCS, Springer, pp. 125-141, Special Event on Analysis of Experimental Algorithms, SEA² 2019, Kalamata, Greece, 19/6/24. https://doi.org/10.1007/978-3-030-34029-2_9

Kawahara J, Saitoh T, Suzuki H, Yoshinaka R. Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs. In Kotsireas I, Pardalos P, Tsokas A, Parsopoulos KE, Souravlias D, editors, Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers. Springer. 2019. p. 125-141. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-34029-2_9

Kawahara, Jun ; Saitoh, Toshiki ; Suzuki, Hirofumi ; Yoshinaka, Ryo. / Colorful Frontier-Based Search : Implicit Enumeration of Chordal and Interval Subgraphs. Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers. editor / Ilias Kotsireas ; Panos Pardalos ; Arsenis Tsokas ; Konstantinos E. Parsopoulos ; Dimitris Souravlias. Springer, 2019. pp. 125-141 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{44b5d1275daf4335ac751fd33d8f1ad5,

title = "Colorful Frontier-Based Search: Implicit Enumeration of Chordal and Interval Subgraphs",

abstract = "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.",

keywords = "Chordal graph, Decision diagram, Frontier-based search, Graph algorithm, Graph enumeration, Interval graph",

author = "Jun Kawahara and Toshiki Saitoh and Hirofumi Suzuki and Ryo Yoshinaka",

year = "2019",

month = jan,

day = "1",

doi = "10.1007/978-3-030-34029-2_9",

language = "English",

isbn = "9783030340285",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "125--141",

editor = "Ilias Kotsireas and Panos Pardalos and Arsenis Tsokas and Parsopoulos, {Konstantinos E.} and Dimitris Souravlias",

booktitle = "Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers",

note = "Special Event on Analysis of Experimental Algorithms, SEA² 2019 ; Conference date: 24-06-2019 Through 29-06-2019",

}

TY - GEN

T1 - Colorful Frontier-Based Search

T2 - Special Event on Analysis of Experimental Algorithms, SEA² 2019

AU - Kawahara, Jun

AU - Saitoh, Toshiki

AU - Suzuki, Hirofumi

AU - Yoshinaka, Ryo

PY - 2019/1/1

Y1 - 2019/1/1

N2 - 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.

AB - 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.

KW - Chordal graph

KW - Decision diagram

KW - Frontier-based search

KW - Graph algorithm

KW - Graph enumeration

KW - Interval graph

UR - http://www.scopus.com/inward/record.url?scp=85076409280&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85076409280&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-34029-2_9

DO - 10.1007/978-3-030-34029-2_9

M3 - Conference contribution

AN - SCOPUS:85076409280

SN - 9783030340285

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 125

EP - 141

BT - Analysis of Experimental Algorithms - Special Event,SEA² 2019, Revised Selected Papers

A2 - Kotsireas, Ilias

A2 - Pardalos, Panos

A2 - Tsokas, Arsenis

A2 - Parsopoulos, Konstantinos E.

A2 - Souravlias, Dimitris

PB - Springer

Y2 - 24 June 2019 through 29 June 2019

ER -