Recognizing circle graphs in polynomial time
Journal of the ACM (JACM)
Discrete Applied Mathematics - Computational combinatiorics
Easy problems for tree-decomposable graphs
Journal of Algorithms
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
An O(n2) algorithm for undirected split decomposition
Journal of Algorithms
Journal of Algorithms
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Edge dominating set and colorings on graphs with fixed clique-width
Discrete Applied Mathematics
On the complexity of the maximum cut problem
Nordic Journal of Computing
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
O(m logn) Split Decomposition of Strongly Connected Graphs
Graph Theory, Computational Intelligence and Thought
O(mlogn) split decomposition of strongly-connected graphs
Discrete Applied Mathematics
Parameterized algorithms for the independent set problem in some hereditary graph classes
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Using split composition to extend distance-hereditary graphs in a generative way
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Journal of Discrete Algorithms
Distance-hereditary comparability graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
We show how to use the split decomposition to solve some NP-hard optimization problems on graphs. We give algorithms for clique problem and domination-type problems. Our main result is an algorithm to compute a coloration of a graph using its split decomposition. Finally we show that the clique-width of a graph is bounded if and only if the clique-width of each representative graph in its split decomposition is bounded.