Gray Code Enumeration of Plane Straight-Line Graphs

We develop Gray code enumeration schemes for geometric straight-line graphs in the plane. The considered graph classes include plane graphs, connected plane graphs, and plane spanning trees. Previous results were restricted to the case where the underlying vertex set is in convex position. [PUBLICAT...

Full description

Saved in:
Bibliographic Details
Published in:Graphs and combinatorics 2007-10, Vol.23 (5), p.467-479
Main Authors: Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.
Format: Article
Language:English
Subjects:
Computer science
Graph theory
Mathematics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We develop Gray code enumeration schemes for geometric straight-line graphs in the plane. The considered graph classes include plane graphs, connected plane graphs, and plane spanning trees. Previous results were restricted to the case where the underlying vertex set is in convex position. [PUBLICATION ABSTRACT]
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-007-0750-z