Complexity of graph partition problems

Authors:
Tomas Feder;Pavol Hell;Sulamita Klein;Rajeev Motwani
Affiliations:
Stanford University;Simon Fraser University, Burnaby, B.C., Canada, V5A 1S6;Departamento da Ciência da Computaçao - I.M., COPPE/Sistemas, Universidade Federal do Rio de Jeneiro, RJ, 21945-970, Brasil;Department of Computer Science, Stanford University, CA
Venue:
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Year:
1999

Citing 13
Cited 28

On the complexity of H-coloring

Journal of Combinatorial Theory Series B
A solution to a colouring problem of P. Erdős

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Complete multi-partite cutsets in minimal imperfect graphs

Journal of Combinatorial Theory Series B
Partitions of graphs into one or two independent sets and cliques

Discrete Mathematics
List homomorphisms to reflexive graphs

Journal of Combinatorial Theory Series B
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

SIAM Journal on Computing
Generalized partitions of graphs

Discrete Applied Mathematics
Linear-time modular decomposition and efficient transitive orientation of comparability graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Computational complexity of compaction to cycles

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Recognizing Perfect 2-Split Graphs

SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Linear Algorithm for Modular Decomposition

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

General partitioning on random graphs

Journal of Algorithms
On the Complexity of (k, l)-Graph Sandwich Problems

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
The list partition problem for graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Partitioning chordal graphs into independent sets and cliques

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Stable skew partition problem

Discrete Applied Mathematics
On decision and optimization (k, l)-graph sandwich problems

Discrete Applied Mathematics
A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results

Journal of Computer and System Sciences
List matrix partitions of chordal graphs

Theoretical Computer Science - Graph colorings
Digraph matrix partitions and trigraph homomorphisms

Discrete Applied Mathematics
Analysis and algorithms design for the partition of large-scale adaptive mobile wireless networks

Computer Communications
On the minimum monochromatic or multicolored subgraph partition problems

Theoretical Computer Science
Forbidden lifts (NP and CSP for combinatorialists)

European Journal of Combinatorics
Polarity of chordal graphs

Discrete Applied Mathematics
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces

Theoretical Computer Science
A load balancing scheme for massively multiplayer online games

Multimedia Tools and Applications
Mining frequent instances on workflows

PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A connectivity based partition approach for node scheduling in sensor networks

DCOSS'07 Proceedings of the 3rd IEEE international conference on Distributed computing in sensor systems
Characterization and recognition of P4-sparse graphs partitionable into k independent sets and ℓ cliques

Discrete Applied Mathematics
Algorithms for partition of some class of graphs under compaction

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Two fixed-parameter algorithms for the cocoloring problem

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Algorithms for some h-join decompositions

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Sum-Max graph partitioning problem

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
NP by means of lifts and shadows

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Polar permutation graphs are polynomial-time recognisable

European Journal of Combinatorics
Cycle transversals in perfect graphs and cographs

Theoretical Computer Science
Fixed-parameter algorithms for the cocoloring problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Complexity of graph partition problems

Quantified Score

Visualization

Abstract