The optimal linear arrangement problem: algorithms and approximation

[1]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[2]  Craig A. Tovey,et al.  Recursively constructed graph families: membership and linear algorithms , 1988 .

[3]  M. B. Richey,et al.  Combinatorial optimization on series-parallel graphs: algorithms and complexity , 1985 .

[4]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[5]  Ronald L. Rardin,et al.  On finding spanning eulerian subgraphs , 1985 .

[6]  Susanne E. Hambrusch,et al.  Planar linear arrangements of outerplanar graphs , 1988 .

[7]  Stephen Wolfram,et al.  Mathematica: a system for doing mathematics by computer (2nd ed.) , 1991 .

[8]  Mark D. Hansen Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[10]  J. P. Blanks Near-optimal quadratic-based placement for a class of IC layout problems , 1985, IEEE Circuits and Devices Magazine.

[11]  Martin Cohn On the channel capacity of read/write isolated memory , 1995 .

[12]  D. Adolphson Optimal linear-ordering. , 1973 .

[13]  László Lovász,et al.  Lengths of cycles in halin graphs , 1985, J. Graph Theory.

[14]  Craig A. Tovey,et al.  Deterministic Decomposition of Recursive Graph Classes , 1991, SIAM J. Discret. Math..

[15]  Weiguo Liu,et al.  Generating Lower Bounds for the Linear Arrangement Problem , 1995, Discret. Appl. Math..

[16]  Gérard Cornuéjols,et al.  Halin graphs and the travelling salesman problem , 1983, Math. Program..

[17]  Fan Chung,et al.  On optimal linear arrangements of trees , 1984 .

[18]  Yossi Shiloach,et al.  A Minimum Linear Arrangement Algorithm for Undirected Trees , 1979, SIAM J. Comput..

[19]  Steven Skiena,et al.  Implementing discrete mathematics - combinatorics and graph theory with Mathematica , 1990 .

[20]  L. H. Harper Optimal numberings and isoperimetric problems on graphs , 1966 .

[21]  R. Durbin,et al.  Optimal numberings of an N N array , 1986 .

[22]  Bojan Mohar,et al.  Optimal linear labelings and eigenvalues of graphs , 1992, Discret. Appl. Math..