On a graph partition problem with application to VLSI layout
From MaRDI portal
Recommendations
Cites work
- A new polynomial-time algorithm for linear programming
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Finding a maximum independent set in a permutation graph
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 3644821 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On certain polytopes associated with graphs
- Parallel concepts in graph theory
- Perfect zero–one matrices
- Permutation Graphs and Transitive Graphs
- The NP-completeness column: an ongoing guide
Cited in
(42)- An optimal parallel algorithm for node ranking of cographs
- On vertex ranking of a starlike graph
- \(l_p\)-optimal rankings and max-optimal rankings are different
- ILP models and column generation for the minimum sum coloring problem
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors
- Graph partitioning applied to the logic testing of combinational circuits
- Finding the edge ranking number through vertex partitions
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- A branch-and-price algorithm for the minimum sum coloring problem
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition
- Minimum sum coloring problem: upper bounds for the chromatic strength
- Rank numbers for bent ladders
- Minimal rankings and the arank number of a path
- Vertex ranking of asteroidal triple-free graphs
- scientific article; zbMATH DE number 2185598 (Why is no real title available?)
- Fully dynamic algorithms for permutation graph coloring
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
- scientific article; zbMATH DE number 1189243 (Why is no real title available?)
- scientific article; zbMATH DE number 88981 (Why is no real title available?)
- Approximation results for the optimum cost chromatic partition problem
- Approximation Results for the Optimum Cost Chromatic Partition Problem
- On finding separators in temporal split and permutation graphs
- On finding separators in temporal split and permutation graphs
- Rankings of graphs
- Vertex ranking of asteroidal triple-free graphs
- The optimal cost chromatic partition problem for trees and interval graphs
- Graphs whose \(l_p\)-optimal rankings are \(l_{\infty}\) optimal
- An improved bi-criteria evolutionary approach for the sum coloring of graphs
- An improved bi-criteria evolutionary approach for the sum coloring of graphs
- An exact algorithm for the minimum sum coloring problem on partially decomposable graphs
- A fast local search algorithm for minimum sum coloring problem on massive graphs
- Combinatorial generation via permutation languages. IV: Elimination trees
- Rank numbers for some trees and unicyclic graphs
- Hitting sets online and unique-MAX coloring
- Max-optimal and sum-optimal labelings of graphs
- A framework for solving VLSI graph layout problems
- An optimal parallel algorithm forc-vertex-ranking of trees
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
- Constructing a minimum height elimination tree of a tree in linear time
- Maximizing the number of edges in optimal \(k\)-rankings
- Minimal k-rankings and the rank number of P^2_n
This page was built for publication: On a graph partition problem with application to VLSI layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199941)
