Edge clique partition of k

Authors:
Rudolf Fleischer;Xiaotian Wu
Affiliations:
School of CS and IIPL, Fudan University, Shanghai, China;School of CS and IIPL, Fudan University, Shanghai, China
Venue:
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Year:
2010

Citing 10
Cited 0

The number of triangles in a K4-free graph

Discrete Mathematics
The spatial complexity of oblivious k-probe Hash functions

SIAM Journal on Computing
Color-coding

Journal of the ACM (JACM)
Graph separators: a parameterized view

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Journal of the ACM (JACM)
Parameterized complexity of the clique partition problem

CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Partition into cliques for cubic graphs: Planar case, complexity and approximation

Discrete Applied Mathematics
Clustering with partial information

Theoretical Computer Science
Upper bounds for vertex cover further improved

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

Edge k-Clique Partitionk-ECP is the problem of dividing the edge set of an undirected graph into a set of at most k edge-disjoint cliques, where k≥1 is an input parameter. The problem is NP-hard but in FPT. We propose several improved FPT algorithms for k-ECP on K4-free graphs, planar graphs, and cubic graphs.