JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/15855

Title: Enumeration of Nonisomorphic Interval Graphs and Nonisomorphic Permutation Graphs
Authors: Yamazaki, Kazuaki
Saitoh, Toshiki
Kiyomi, Masashi
Uehara, Ryuhei
Keywords: enumeration
graph isomorphism
interval graph
permutation graph
reverse search
Issue Date: 2018-01-31
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 10755
Start page: 8
End page: 19
DOI: 10.1007/978-3-319-75172-6_2
Abstract: In this paper, a general framework for enumerating every element in a graph class is given. The main feature of this framework is that it is designed to enumerate only non-isomorphic graphs in a graph class. Each element in the class is output in a polynomial time delay. Applying this framework to the classes of interval graphs and permutation graphs, we give efficient enumeration algorithms for these graph classes.The experimental results are also provided. The catalogs of graphs in these graph classes are also provided.
Rights: This is the author-created version of Springer, Kazuaki Yamazaki, Toshiki Saitoh, Masashi Kiyomi and Ryuhei Uehara, Lecture Notes in Computer Science, 10755, 2018, 8-19. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-319-75172-6_2
URI: http://hdl.handle.net/10119/15855
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
23994.pdf175KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, Japan Advanced Institute of Science and Technology