On a graph partitioning problem with applications to VLSI layout (original) (raw)
Related papers
On a Graph Partition Problem with Application to VLSI Layout
Information Processing Letters, 1992
Packings by cliques and by finite families of graphs
Discrete Mathematics, 1984
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
Lecture Notes in Computer Science, 1988
Partitioning graphs into complete and empty graphs
Discrete Mathematics, 2009
Polynomial algorithms for perfect graphs
1984
On Satisfactory Partitioning of Graphs
2002
Combinatorica, 2007
Star Partitions of Perfect Graphs
Lecture Notes in Computer Science, 2014
The domatic number problem on some perfect graph families
Information Processing Letters, 1994
On the complexity of the black-and-white coloring problem on some classes of perfect graphs
Theoretical Computer Science, 2014
Polynomial{Time Partition of a Graph into Cliques
Polynomial-time partition of a graph into cliques, 1995
A polynomial characterization of some graph partitioning problems
Information Processing Letters, 1988
Partitioning Perfect Graphs into Stars
Journal of Graph Theory, 2016
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Discrete Applied Mathematics, 1996
On the Clique-Width of Some Perfect Graph Classes
International Journal of Foundations of Computer Science, 2000
Partitions of graphs into small and large sets
Discrete Applied Mathematics, 2013
The American Mathematical Monthly, 2015
On the Complete Width and Edge Clique Cover Problems
Lecture Notes in Computer Science, 2015
Parameterized Complexity of the Clique Partition Problem
2008
Clique-perfectness and balancedness of some graph classes
International Journal of Computer Mathematics, 2014
On clique-perfect and K-perfect graphs
Ars Combinatoria - ARSCOM, 2006
NP-completeness results for some problems on subclasses of bipartite and chordal graphs
Theoretical Computer Science, 2007
Maximal-clique partitions of interval graphs
Journal of the Australian Mathematical Society, 1988
List Partitions of Chordal Graphs
Lecture Notes in Computer Science, 2004
Computing All Maximal Clique Partitions in a Graph
2020
Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
SIAM Journal on Computing, 1996
A linear time algorithm for graph partition problems
Information Processing Letters, 1992
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Discrete Applied Mathematics, 1994
Listing all potential maximal cliques of a graph
2019
A characterisation of clique-width through nested partitions
Discrete Applied Mathematics, 2015
Enumerating All Maximal Clique-Partitions of an Undirected Graph
Electronic Proceedings in Theoretical Computer Science
Matrix partitions of perfect graphs
Discrete Mathematics, 2006