|
|
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/11644
|
| Title: | Bounding the Number of Reduced Trees, Cographs, and Series-Parallel Graphs by Compression |
| Authors: | Uno, Takeaki
Uehara, Ryuhei
Nakano, Shin-ichi |
| Keywords: | cograph
compact representation
counting
encoding/decoding scheme
series-parallel graph, unordered reduced tree |
| Issue Date: | 2013-06-21 |
| Publisher: | World Scientific Publishing |
| Magazine name: | Discrete Mathematics, Algorithms and Applications |
| Volume: | 5 |
| Number: | 2 |
| Start page: | 1360001-1 |
| End page: | 1360001-14 |
| DOI: | 10.1142/S179383091360001X |
| Abstract: | We give an efficient encoding and decoding scheme for computing a compact representation of a graph in one of unordered reduced trees, cographs, and series-parallel graphs. The unordered reduced trees are rooted trees in which (i) the ordering of children of each vertex does not matter, and (ii) no vertex has exactly one child. This is one of basic models frequently used in many areas. Our algorithm computes a bit string of length 2l-1 for a given unordered reduced tree with l >= 1 leaves in O(l) time, whereas a known folklore algorithm computes a bit string of length 2n -2 for an ordered tree with n vertices. Note that in an unordered reduced tree l <= n< 2l holds. To the best of our knowledge this is the first such a compact representation for unordered reduced trees. From the theoretical point of view, the length of the representation gives us an upper bound of the number of unordered reduced trees with l leaves. Precisely, the number of unordered reduced trees with l leaves is at most 2^<2l-2> for l >=1. Moreover, the encoding and decoding can be done in linear time. Therefore, from the practical point of view, our representation is also useful to store a lot of unordered reduced trees efficiently. We also apply the scheme for computing a compact representation to cographs and series-parallel graphs. We show that each of cographs with n vertices has a compact representation in 2n-1 bits, and the number of cographs with n vertices is at most 2^<2n-1>. The resulting number is close to the number of cographs with n vertices obtained by the enumeration for small n that approximates C d^n/n^<3/2>, where C=0.4126… and d=3.5608…. Series-parallel graphs are well investigated in the context of the graphs of bounded treewidth. We give a method to represent a series-parallel graph with m edges in (2.5285m-2) bits. Hence the number of series-parallel graphs with m edges is at most 2^<2.5285m-2>. As far as the authors know, this is the first non-trivial result about the number of series-parallel graphs. The encoding and decoding of the cographs and series-parallel graphs also can be done in linear time. |
| Rights: | Electronic version of an article published as Discrete Mathematics, Algorithms and Applications, 5(2), 2013, 1360001-1-1360001-14. DOI:10.1142/S179383091360001X. Copyright World Scientific Publishing Company, http://dx.doi.org/10.1142/S179383091360001X |
| URI: | http://hdl.handle.net/10119/11644 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 19167.pdf | | 238Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
