The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
뿌리가 있는 삼각 평면 그래프에서는 외부 정점과 이에 입사하는 두 외부 가장자리가 각각 루트로 지정됩니다. 루트 삼각분할 평면 그래프의 두 평면 임베딩은 지정된 루트가 서로 일치하도록 동형을 허용하는 경우 동등한 것으로 정의됩니다. 양의 정수가 주어지면 n, 우리는 O(n)-공간 및 O(1) - 최대 XNUMX개의 모든 이중 연결 근 삼각 평면 그래프를 생성하는 시간 지연 알고리즘 n 두 개의 반사 대칭 복사본을 제공하지 않고 정점을 삭제합니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Bingbing ZHUANG, Hiroshi NAGAMOCHI, "Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs" in IEICE TRANSACTIONS on Information,
vol. E94-D, no. 2, pp. 200-210, February 2011, doi: 10.1587/transinf.E94.D.200.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E94.D.200/_p
부
@ARTICLE{e94-d_2_200,
author={Bingbing ZHUANG, Hiroshi NAGAMOCHI, },
journal={IEICE TRANSACTIONS on Information},
title={Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs},
year={2011},
volume={E94-D},
number={2},
pages={200-210},
abstract={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.},
keywords={},
doi={10.1587/transinf.E94.D.200},
ISSN={1745-1361},
month={February},}
부
TY - JOUR
TI - Generation of Symmetric and Asymmetric Biconnected Rooted Triangulated Planar Graphs
T2 - IEICE TRANSACTIONS on Information
SP - 200
EP - 210
AU - Bingbing ZHUANG
AU - Hiroshi NAGAMOCHI
PY - 2011
DO - 10.1587/transinf.E94.D.200
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E94-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2011
AB - 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.
ER -