Pages that link to "Item:Q1199941"
From MaRDI portal
The following pages link to On a graph partition problem with application to VLSI layout (Q1199941):
Displaying 31 items.
- Vertex ranking of asteroidal triple-free graphs (Q293448) (← links)
- Rank numbers for some trees and unicyclic graphs (Q719660) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- Max-optimal and sum-optimal labelings of graphs (Q763483) (← links)
- An optimal parallel algorithm forc-vertex-ranking of trees (Q834935) (← links)
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem (Q860400) (← links)
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- Maximizing the number of edges in optimal \(k\)-rankings (Q896093) (← links)
- Minimal \(k\)-rankings and the rank number of \(P^2_n\) (Q976072) (← links)
- An optimal parallel algorithm for node ranking of cographs (Q1270781) (← links)
- On vertex ranking of a starlike graph (Q1603539) (← links)
- \(l_p\)-optimal rankings and max-optimal rankings are different (Q1696534) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- Finding the edge ranking number through vertex partitions (Q1949112) (← links)
- On the vertex ranking problem for trapezoid, circular-arc and other graphs (Q1961233) (← links)
- Tree partitioning under constraints. -- Clustering for vehicle routing problems (Q1962035) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- Minimum sum coloring problem: upper bounds for the chromatic strength (Q2410252) (← links)
- Rank numbers for bent ladders (Q2450128) (← links)
- Minimal rankings and the arank number of a path (Q2501577) (← links)
- Fully dynamic algorithms for permutation graph coloring (Q3123352) (← links)
- (Q3839008) (← links)
- Approximation results for the optimum cost chromatic partition problem (Q4572001) (← links)
- On finding separators in temporal split and permutation graphs (Q5918685) (← links)
- On finding separators in temporal split and permutation graphs (Q5925700) (← links)
- Rankings of graphs (Q6184378) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
- The optimal cost chromatic partition problem for trees and interval graphs (Q6550551) (← links)
- Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal (Q6586648) (← links)
