Graphs That are Almost Binary Trees

DOI10.1137/0211018zbMath0486.05055OpenAlexW1967247432MaRDI QIDQ3946200

Jia-Wei Hong, Arnold L. Rosenberg

Publication date: 1982

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0211018

zbMATH Keywords

binary treesgraph embeddingsgraph separatorssource graphtarget graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)

Related Items

Optimal dynamic embedding of X-trees into arrays ⋮ A variation on the min cut linear arrangement problem ⋮ On the complexity of tree embedding problems ⋮ Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design