NL repository
menu
검색
Library
Browse
Communities & Collections
By Date
Authors
Titles
Subject
My Repository
My Account
Receive email updates
Edit Profile
DSpace at EWHA
인공지능대학
컴퓨터공학과
Journal papers
View : 715 Download: 0
Finding planar geometric automorphisms in planar graphs
Title
Finding planar geometric automorphisms in planar graphs
Authors
Hong S.-H.
;
Eades P.
;
Lee S.-H.
Ewha Authors
이상호
SCOPUS Author ID
이상호
Issue Date
1998
Journal Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN
0302-9743
Citation
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol. 1533 LNCS, pp. 277 - 286
Indexed
SCOPUS
Document Type
Conference Paper
Abstract
Drawing a graph symmetrically enables an understanding of the entire graph to be built up from that of smaller subgraphs. This paper discusses symmetric drawings of planar graphs. More specifically, we discuss planar geometric automorphisms, that is, automorphisms of a graph G that can be represented as symmetries of a planar drawing of G. Finding planar geometric automorphisms is the first and most difficult step in constructing planar symmetric drawings of graphs. The problem of determining whether a given graph has a nontrivial geometric automorphism is NP-complete for general graphs. In this paper, we present a polynomial time algorithm for finding planar geometric automorphisms of graphs. © Springer-Verlag Berlin Heidelberg 1998.
ISBN
3540653856
9783540653851
Appears in Collections:
인공지능대학
>
컴퓨터공학과
>
Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML
Show full item record
Find@EWHA
트윗하기
BROWSE
Communities & Collections
By Date
Authors
Titles
Subject