Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system

Simple item page
dc.contributor.authorEades, Peter
dc.contributor.authorHong, Seok-Hee
dc.contributor.authorKatoh, Naoki
dc.contributor.authorLiotta, Giuseppe
dc.contributor.authorSchweitzer, Pascal
dc.contributor.authorSuzuki, Yusuke
dc.date.accessioned2015-12-13T22:39:41Z
dc.date.issued2013
dc.date.updated2015-12-11T09:51:43Z
dc.description.abstractA 1-planar graph is a graph that can be embedded in the plane with at most one crossing per edge. It is known that testing 1-planarity of a graph is NP-complete. In this paper, we consider maximal 1-planar graphs. A graph G is maximal 1-planar if addition
dc.identifier.issn0304-3975
dc.identifier.urihttp://hdl.handle.net/1885/77885
dc.publisherElsevier
dc.sourceTheoretical Computer Science
dc.titleA linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
dc.typeJournal article
local.bibliographicCitation.lastpage76
local.bibliographicCitation.startpage65
local.contributor.affiliationEades, Peter, University of Sydney
local.contributor.affiliationHong, Seok-Hee, University of Sydney
local.contributor.affiliationKatoh, Naoki, Kyoto University
local.contributor.affiliationLiotta, Giuseppe, Universita di Perugia
local.contributor.affiliationSchweitzer, Pascal, College of Engineering and Computer Science, ANU
local.contributor.affiliationSuzuki, Yusuke, Niigata University
local.contributor.authoruidSchweitzer, Pascal, u4878524
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor080611 - Information Systems Theory
local.identifier.absseo970108 - Expanding Knowledge in the Information and Computing Sciences
local.identifier.ariespublicationf5625xPUB6631
local.identifier.citationvolume513
local.identifier.doi10.1016/j.tcs.2013.09.029
local.identifier.scopusID2-s2.0-84888138030
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Eades_A_linear_time_algorithm_for_2013.pdf
Size:
254.24 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS