On Minimal Augmentation of a Graph to Obtain an Interval Graph

Abstract This paper deals with the problem of adding edges to a graph such that the resulting graph becomes an interval graph. The set of edges added is called an augmentation. An algorithm is presented to find a minimal augmentation which runs in a time proportional to the product of the number of vertices and the number of edges of the resulting graph.

[1]  E. Kuh,et al.  One-dimensional logic gate assignment and interval graphs , 1979, COMPSAC.

[2]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[3]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[4]  K. Kani,et al.  A heuristic procedure for ordering MOS arrays , 1975, DAC '75.

[5]  T. Ohtsuki,et al.  Minimal triangulation of a graph and optimal pivoting order in a sparse matrix , 1976 .

[6]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[7]  Tatsuo Ohtsuki,et al.  A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph , 1976, SIAM J. Comput..

[8]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[9]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[10]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[12]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[13]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[14]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.