Given two integers n and m with 1 < m < n, we consider the problem of generating nonisomorphic colored outerplanar graphs with at most n vertices, where each outerplanar graph is colored with at most m colors. In this paper, we treat outerplanar graphs as rooted outerplane graphs, i.e., plane embeddings with a designated vertex as the root, and propose an efficient algorithm for generating all such colored graphs based on a unique representation of those embeddings. Our algorithm runs in O(n) space and outputs all colored and rooted outerplane graphs without repetition in O(1) time per graph. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Wang, J., Zhao, L., Nagamochi, H., & Akutsu, T. (2007). An efficient algorithm for generating colored outerplanar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4484 LNCS, pp. 573–583). Springer Verlag. https://doi.org/10.1007/978-3-540-72504-6_52
Mendeley helps you to discover research relevant for your work.