2011年2月
Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
- ,
- 巻
- E94D
- 号
- 2
- 開始ページ
- 200
- 終了ページ
- 210
- 記述言語
- 英語
- 掲載種別
- 研究論文(学術雑誌)
- DOI
- 10.1587/transinf.E94.D.200
- 出版者・発行元
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
In a rooted triangulated planar graph, an outer vertex and two outer edges incident to it are designated as its root, respectively. Two plane embeddings of rooted triangulated planar graphs are defined to be equivalent if they admit an isomorphism such that the designated roots correspond to each other. Given a positive integer n, we give an O(n)-space and O(1)-time delay algorithm that generates all biconnected rooted triangulated planar graphs with at most n vertices without delivering two reflectively symmetric copies.
- リンク情報
-
- DOI
- https://doi.org/10.1587/transinf.E94.D.200
- DBLP
- https://dblp.uni-trier.de/rec/journals/ieicet/ZhuangN11
- Web of Science
- https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000290125800005&DestApp=WOS_CPL
- URL
- http://search.ieice.org/bin/summary.php?id=e94-d_2_200
- URL
- http://dblp.uni-trier.de/db/journals/ieicet/ieicet94d.html#journals/ieicet/ZhuangN11
- ID情報
-
- DOI : 10.1587/transinf.E94.D.200
- ISSN : 0916-8532
- DBLP ID : journals/ieicet/ZhuangN11
- Web of Science ID : WOS:000290125800005