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
N1 - Funding Information:
Acknowledgment. This work was supported in part by JSPS KAKENHI Grant Numbers JP15H05711, JP18K04610, JP16K16006, JP18H04091 and JP19K12098, and NAIST Big Data Project.
Publisher Copyright:
© 2019, Springer Nature Switzerland AG.
PY - 2019
Y1 - 2019
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 -