scientific article; zbMATH DE number 6131601
From MaRDI portal
zbMath1257.68011MaRDI QIDQ4904150
Publication date: 28 January 2013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Efficient reassembling of graphs. I: The linear case, A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees, Polynomial time efficient construction heuristics for vertex separation minimization problem, Compact representation of graphs with bounded bandwidth or treedepth, Scheduling series-parallel task graphs to minimize peak memory, Lower and upper bounds for the linear arrangement problem on interval graphs, A note on minimum linear arrangement for BC graphs, Unnamed Item
