scientific article; zbMATH DE number 6131601

MaRDI QIDQ4904150zbMATH OpenFDO

Authors Jordi Petit

Publication date 28 January 2013

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• Layout problems with reachability constraint
• Two results on layered pathwidth and linear layouts
• Static and Dynamic Layout Problems with Varying Areas
• scientific article; zbMATH DE number 475618
• Models and algorithms for structured layout
• scientific article; zbMATH DE number 1192964
• A new approach to the block layout problem

Cited in

(13)

• Scheduling series-parallel task graphs to minimize peak memory
• Efficient reassembling of graphs. I: The linear case
• Polynomial time efficient construction heuristics for vertex separation minimization problem
• Compact representation of graphs with bounded bandwidth or treedepth
• Lower and upper bounds for the linear arrangement problem on interval graphs
• A note on minimum linear arrangement for BC graphs
• Graph and string parameters: connections between pathwidth, cutwidth and the locality number
• A correction on Shiloach's algorithm for minimum linear arrangement of trees
• Hardness and approximation of submodular minimum linear ordering problems
• The sum of edge lengths in random linear arrangements
• Exact and heuristic computation of the scanwidth of directed acyclic graphs
• Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
• Graph and string parameters: connections between pathwidth, cutwidth and the locality number

This page was built for publication:

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