Partitioning technique for transforming perfect binary trees into single-row networks

DOI10.1007/S13160-012-0071-3MaRDI QIDQ691994zbMATH OpenOpenAlexFDO

Authors Ser Lee Loh, Shaharuddin Salleh

Publication date 4 December 2012

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s13160-012-0071-3

zbMATH Keywords

perfect binary treesingle-row routingtransformation and spine

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Partitioning bispanning graphs into spanning trees
• Partitioning bispanning graphs into spanning trees
• scientific article; zbMATH DE number 672025
• Efficient partition trees
• Optimal partition trees
• Optimal partition trees
• A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees
• Single-pass streaming algorithms to partition graphs into few forests
• Partitioning of biweighted trees
• Obstacles to partitioning a graph into trees

Cites work

• Enhanced simulated annealing technique for the single-row routing problem
• On optimum single-row routing
• Optimization by simulated annealing
• Single-row transformation of complete graphs
• The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row, single-layer case

Cited in

(1)

• scientific article; zbMATH DE number 1163560 (Why is no real title available?)

This page was built for publication: Partitioning technique for transforming perfect binary trees into single-row networks

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