The linear arrangement problem on recursively constructed graphs

DOI10.1002/NET.10093MaRDI QIDQ4432765zbMATH OpenOpenAlexFDO

Authors R. G. Parker, S. Horton, T. Easton

Publication date 29 October 2003

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10093

zbMATH Keywords

Halin graphsoptimal linear arrangement

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Linear arrangement problems on recursively partitioned graphs
• scientific article; zbMATH DE number 6378818
• scientific article; zbMATH DE number 1161294
• On optimal linear arrangements of trees
• Linear Arrangement Problems and Interval Graphs

Cited in

(3)

• Linear Arrangement Problems and Interval Graphs
• Linear arrangement problems on recursively partitioned graphs
• A note on minimum linear arrangement for BC graphs

This page was built for publication: The linear arrangement problem on recursively constructed graphs

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