View : 808 Download: 0

Full metadata record

DC Field Value Language
dc.contributor.author이상호*
dc.date.accessioned2016-08-27T02:08:30Z-
dc.date.available2016-08-27T02:08:30Z-
dc.date.issued1998*
dc.identifier.isbn3-540-65385-6*
dc.identifier.issn0302-9743*
dc.identifier.otherOAK-553*
dc.identifier.urihttps://dspace.ewha.ac.kr/handle/2015.oak/215383-
dc.description.abstractDrawing 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.*
dc.languageEnglish*
dc.publisherSPRINGER-VERLAG BERLIN*
dc.titleFinding planar geometric automorphisms in planar graphs (extended abstract)*
dc.typeArticle*
dc.typeProceedings Paper*
dc.relation.volume1533*
dc.relation.indexSCOPUS*
dc.relation.startpage277*
dc.relation.lastpage286*
dc.relation.journaltitleALGORITHMS AND COMPUTATIONS*
dc.identifier.wosidWOS:000165171800030*
dc.author.googleHong, SH*
dc.author.googleEades, P*
dc.author.googleLee, SH*
dc.contributor.scopusid이상호(56812941400)*
dc.date.modifydate20240322133058*
Appears in Collections:
인공지능대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

BROWSE