scientific article; zbMATH DE number 4121434
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Complexity of computation (including implicit computational complexity) (03D15)
Recommendations
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
- On NP-hardness of the clique partition -- independence number gap recognition and related problems
- On clique partitions of split graphs
- The complexity of generalized clique packing
- Edge clique partition in \((k,\ell)\)-graphs
Cited in
(15)- Partition into cliques for cubic graphs: Planar case, complexity and approximation
- On clique partitions of split graphs
- Edge clique partition of \(K _{4}\)-free and planar graphs
- Edge clique partition in \((k,\ell)\)-graphs
- Weighted 2-sections and hypergraph reconstruction
- The complexity of generalized clique packing
- Constrained representations of map graphs and half-squares
- Clustering with partial information
- On NP-hardness of the clique partition -- independence number gap recognition and related problems
- scientific article; zbMATH DE number 7764108 (Why is no real title available?)
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
- Clustering with Partial Information
- Graph factors and factorization: 1985--2003: a survey
- The complexity of partitioning into disjoint cliques and a triangle-free graph
- scientific article; zbMATH DE number 4116583 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4734765)
