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

Thumbnail Image

Date

2013

Authors

Eades, Peter
Hong, Seok-Hee
Katoh, Naoki
Liotta, Giuseppe
Schweitzer, Pascal
Suzuki, Yusuke

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

Abstract

A 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

Description

Keywords

Citation

URI

http://hdl.handle.net/1885/77885

Collections

ANU Research Publications

Source

Theoretical Computer Science

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

10.1016/j.tcs.2013.09.029

Restricted until

2037-12-31

Downloads

File
Description
01_Eades_A_linear_time_algorithm_for_2013.pdf (254.24 KB)

DSpace software copyright © 2002-2026 LYRASIS