Graphs That are Almost Binary Trees

DOI10.1137/0211018MaRDI QIDQ3946200zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(4)

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

This page was built for publication: Graphs That are Almost Binary Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3946200)