Efficient deterministic algorithms for embedding graphs on books

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1090, Issue , 1996, Pages 162-168

  Shahrokhi, Farhad ^a   Shi, Weiping ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EMBEDDINGS; POLYNOMIAL APPROXIMATION;

BIPARTITE GRAPHS; BOOK EMBEDDING; DERANDOMIZING; DETERMINISTIC ALGORITHMS; MINIMUM DEGREE; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; SUBGRAPHS;

GRAPH THEORY;

EID: 84948986594     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_149     Document Type: Conference Paper

References (13)

1. N. Alon, J. H. Spencer and P. Erdôs, The Probabilistic Method, Wiley and Sons, New York, 1992.
2. F. Bernhart and B. Kainen, The book thickness of a graph, J. Combin. Theory, B27 (1979), 320-331.
3. F. R. K. Chung, F. T. Leighton and A. Rosenberg, Embedding graphs in books: A layout problem with applications to VLSI design, SIAM J. Alg. Disc. Meth., 8 (1987) 33-58.
4. L. Heath and S. Istrail, The page number of genus g graph is 0(g), J. ACM 39 (1992), 479-500.
5. M. R. Garey, D. S. Johnson, G. L. Miller and C. H. Papadimitriou, The complexity of coloring circular arc graphs and chords, SIAM J. Alg. Disc. Meth., 1 (1980) 33-58.
6. S. M. Malitz, On the page number of graphs, Journal of Algorithms, 17 (1) (1994), 71-84.
7. S. M. Malitz, Genus g graphs have pagenumber O(√g), Journal of Algorithms, 17 (1) (1994), 85-109.
8. D. W. Mafcula and L. L. Beck, Smallest-last ordering and clustering and graph coloring algorithms, J. ACM 30 (1983), 417-427.
9. G. Szekeres and H. S. Wilf, An inequality for the chromatic number of a graph, J. Comb. Theory 4 (1968), 1-3.
10. W. Unger, On the k-coloring of circle graphs, In Proc. 5th Annual Sympo. on Theoretical Aspects of Computer Science, 1988, 61-71.
11. L. Valient, On the complexity of counting the matching, Theoretical Computer Science 8 (1979) 189-201.
12. A. Wigderson, The complexity of the Hamiltonian circuit problem for maximal planar graphs, EECS Report 298, Princeton University, 1982.
13. M. Yannakakis, Embedding planar graphs in four pages, J. Computer and System Science 38 (1989), 36-67.