Paper Abstract and Keywords |
Presentation |
2018-09-18 15:20
Enumeration and Random Sampling of Nonisomorphic Two-Terminal Series-Parallel Graphs Shuhei Denzumi (UTokyo), Takashi Horiyama (Saitama Univ.), Kazuhiro Kurita (Hokudai), Yu Nakahata (NAIST), Hirofumi Suzuki (Hokudai), Kunihiro Wasa (NII), Kazuaki Yamazaki (JAIST) COMP2018-17 |
Abstract |
(in Japanese) |
(See Japanese page) |
(in English) |
A graph $G$ is a two-terminal series-parallel graph if (1) $G$ consists of two vertices and an edge between them or (2) $G$ is generated by the following two operations: ($S$ operation) connecting a pair of two-terminal series-parallel graphs in series, and ($P$ operation) connecting a pair of two-terminal series-parallel graphs in parallel. In this paper, given a natural number $n$, we show a recurrence formula for obtaining the set of two-terminal series-parallel graphs with $n$ edges. Moreover, by using the formula, we develop algorithms for enumerating solutions and outputting a two-terminal series-parallel graph randomly. Both algorithms run in polynomial time and space per solution. |
Keyword |
(in Japanese) |
(See Japanese page) |
(in English) |
Enumeration / two-terminal series-parallel graphs / random sampling / polynomial delay / / / / |
Reference Info. |
IEICE Tech. Rep., vol. 118, no. 216, COMP2018-17, pp. 55-62, Sept. 2018. |
Paper # |
COMP2018-17 |
Date of Issue |
2018-09-11 (COMP) |
ISSN |
Online edition: ISSN 2432-6380 |
Copyright and reproduction |
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
Download PDF |
COMP2018-17 |
|