Inserting an Edge Into a Planar Graph

Inserting an Edge Into a Planar Graph (2000)

by Carsten Gutwenger , Petra Mutzel , René Weiskircher

Venue:	Algorithmica
Citations:	10 - 7 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Inserting an Edge Into a Planar Graph	user correction - Legacy Corrections
AUTHOR NAME	Carsten Gutwenger	user correction - Legacy Corrections
AUTHOR NAME	Petra Mutzel	user correction - Legacy Corrections
AUTHOR NAME	René Weiskircher	user correction - Legacy Corrections
ABSTRACT	Computing a crossing minimum drawing of a given planar graph G augmented by an additional edge e in which all crossings involve e, has been a long standing open problem in graph drawing. Alternatively, the problem can be stated as finding a planar combinatorial embedding of a planar graph G in which the given edge e can be inserted with the minimum number of crossings. Many problems concerned with the optimization over the set of all combinatorial embeddings of a planar graph turned out to be NP-hard. Surprisingly, we found a conceptually simple linear time algorithm based on SPQR-trees, which is able to find a crossing minimum solution.	SVM HeaderParse 0.1
YEAR	2000	INFERENCE
VENUE	Algorithmica	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	246--255	INFERENCE
VOLUME	41	INFERENCE
TECH	Technical report, Technische	INFERENCE
CITATIONS	14 found	ParsCit 1.0