View : 41 Download: 0

Finding planar geometric automorphisms in planar graphs (extended abstract)

Title
Finding planar geometric automorphisms in planar graphs (extended abstract)
Authors
Hong, SHEades, PLee, SH
Ewha Authors
이상호
SCOPUS Author ID
이상호scopus
Issue Date
1998
Journal Title
ALGORITHMS AND COMPUTATIONS
ISSN
0302-9743JCR Link
Citation
vol. 1533, pp. 277 - 286
Publisher
SPRINGER-VERLAG BERLIN
Indexed
SCOPUS WOS
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.
ISBN
3-540-65385-6
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE