On Three Graph Layout Problems

Zusatztext

The bandwidth minimization problem for graphs was first stated in 1966 by Harper, where the problem was solved for hypercubes. Finding the bandwidth of an arbitrary graph is an NP-complete problem and it remains NP-complete for many simple structures, e.g. for cyclic caterpillars with hair length at most 1, graphs in which the removal of all pendant vertices results in a simple cycle. There are only few classes of graphs for which an efficient solution to the bandwidth problem is known. Classes of graphs whose bandwidth can be computed efficiently are butterflies, chain graphs, caterpillars with hair length at most 2. Another nontrivial class, for which the problem was solved efficiently, is the class of interval graphs, graphs which are the intersection graphs of a family of intervals over the real line. The first polynomial algorithm for interval graphs was given in 1986 by the author. It was published in the Reports of NAS RA, where the algorithm is described in detail, and besides a brief proof of its correctness is done. Since this result was independently obtained and published earlier we consider reasonable publishing the full proof of our algorithms correctness.

Autorenportrait

David Muradian is a discrete mathematics specialist from Armenia. His primary area of expertise is graph theory, focused on graph layout problems. Most of results outlined in this publication where produced at the Institute for Informatics and Automation Problems of the National Academy of Sciences of the Republic of Armenia.

Weitere Details