Optimal one-page tree embeddings in linear time

Information Processing Letters

Volumn 87, Issue 2, 2003, Pages 59-66

  Hochberg, Robert A ^a   Stallmann, Matthias F ^b  

^a EAST CAROLINA UNIVERSITY   (United States)

^b North Carolina State University   (United States)

Author keywords

Algorithms; Anchored tree; One page embedding; Optimal embedding

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; POLYNOMIALS; TREES (MATHEMATICS);

OPTIMAL EMBEDDING;

LINEAR PROGRAMMING;

EID: 0038517125     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00261-8     Document Type: Article

References (10)

1. Bernhart F., Kainen P.C. The book thickness of a graph. J. Combin. Theory B. 27:1979;320-331.
2. Chung F. On optimal linear arrangements of trees. Comput. Math. Appl. 10:1984;43-60.
3. Frederickson G.N., Hambrusch S.E. Planar linear arrangements of outerplanar graphs. IEEE Trans. Circuits Systems. 35:1988;323-333.
4. Garey M.R., Johnson D.S., Stockmeyer L. Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1:1976;237-267.
5. Geolezian G.G. On the problem of optimal arrangement of a graph on an interval. Dokl. Armenian Akad. Nauk. 56:1973;269-271.
6. Goldberg M.K., Klipker I.A. An algorithm for minimal numeration of tree vertices. Sakharth. SSR Mecn. Acad. Moambe. 81:1976;553-556. (in Russian).
7. Hochberg R.A. Minimum linear arrangement of trees, Master's thesis, North Carolina State University, Department of Computer Science, Raleigh, NC, 2002. Also available at http://www.lib.ncsu.edu/theses/available/etd-06112002-143058/.
8. Shahrokhi F., Sýkora O., Székely L.A., Vrt́o I. On bipartite drawing and the linear arrangement problem. SIAM J. Comput. 30:2001;1773-1789.
9. Shiloach Y. A minimum linear arrangement algorithm for undirected trees. SIAM J. Comput. 8:1979;15-32.
10. Yao A.C. An O(|E|loglog|V|) algorithm for finding minimum spanning trees. Inform. Process. Lett. 4:1975;21-23.