Pages that link to "Item:Q789395"

The following pages link to On optimal linear arrangements of trees (Q789395):

Displaying 36 items.

• An optimal time algorithm for minimum linear arrangement of chord graphs (Q497140) (← links)
• Heuristics for the data arrangement problem on regular trees (Q498454) (← links)
• The proportion of trees that are linear (Q785803) (← links)
• Routing with critical paths (Q910228) (← links)
• Optimal one-page tree embeddings in linear time (Q1014395) (← links)
• Efficient algorithms for single- and two-layer linear placement of parallel graphs (Q1130417) (← links)
• Optimal linear labelings and eigenvalues of graphs (Q1192949) (← links)
• Fast geometric approximation techniques and geometric embedding problems (Q1202926) (← links)
• Optimal layout of edge-weighted forests (Q1276965) (← links)
• Two results on linear embeddings of complete binary trees (Q1367522) (← links)
• On minimum cuts and the linear arrangement problem (Q1570828) (← links)
• The bandwidth sum of join and composition of graphs (Q1772413) (← links)
• Generating lower bounds for the linear arrangement problem (Q1891924) (← links)
• On bandwidth and edgesum for the composition of two graphs (Q1897434) (← links)
• Optimal linear arrangement of a rectangular grid (Q1970706) (← links)
• Bandwidth sums of block graphs and cacti (Q2015805) (← links)
• Minimum projective linearizations of trees in linear time (Q2059886) (← links)
• Linear time algorithms on mirror trees (Q2091108) (← links)
• Optimal leaf ordering of complete binary trees (Q2466020) (← links)
• A study on cyclic bandwidth sum (Q2471051) (← links)
• Computing an optimal orientation of a balanced decomposition tree for linear arrangement problems (Q2755062) (← links)
• Linear time algorithms to solve the linear ordering problem for oriented tree based graphs (Q2805488) (← links)
• Critical spanning tree and linear arrangement of torus (Q2918823) (← links)
• k-Level Crossing Minimization Is NP-Hard for Trees (Q3078383) (← links)
• The scaling of the minimum sum of edge lengths in uniformly random trees (Q3302733) (← links)
• A variation on the min cut linear arrangement problem (Q3785979) (← links)
• Lower and upper bounds for the linear arrangement problem on interval graphs (Q4634312) (← links)
• Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path (Q5087084) (← links)
• On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem (Q5096926) (← links)
• A Correction on Shiloach's Algorithm for Minimum Linear Arrangement of Trees (Q5283240) (← links)
• Bounds of the sum of edge lengths in linear arrangements of trees (Q5857519) (← links)
• Optimal arrangement of data in a tree directory (Q5951966) (← links)
• The maximum linear arrangement problem for trees under projectivity and planarity (Q6072193) (← links)
• Parameterized algorithms for minimum sum vertex cover (Q6547957) (← links)
• Simultaneous drawing of layered trees (Q6575380) (← links)
• Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)