scientific article; zbMATH DE number 7764108

DOI10.4230/LIPICS.IPEC.2020.17MaRDI QIDQ6068263zbMATH OpenFDO

Authors Andreas Emil Feldmann, Davis Issac, Ashutosh Rai

Publication date 13 November 2023

Full work available at URL https://arxiv.org/abs/2002.07761

zbMATH Keywords

edge clique partitionfixed-parameter tractabilitykernelization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Algorithms in computer science (68Wxx)

Recommendations

• ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• On the clique partitioning problem in weighted interval graphs
• scientific article; zbMATH DE number 26478
• Some approximation algorithms for the clique partition problem in weighted interval graphs
• A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
• On the complexity of some edge-partition problems for graphs
• Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract)
• On the minimum clique partitioning problem on weighted chordal graphs
• Algorithms for vertex-partitioning problems on graphs with fixed clique-width.

Cites work

• A contribution to the Zarankiewicz problem
• Applications of edge coverings by cliques
• Bounding the running time of algorithms for scheduling and packing problems
• Clique cover on sparse networks
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Covering graphs with few complete bipartite subgraphs
• Data reduction, exact, and heuristic algorithms for clique cover
• Discovery Science
• Edge clique partition of \(K _{4}\)-free and planar graphs
• scientific article; zbMATH DE number 4121434 (Why is no real title available?)
• Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
• Invitation to discrete mathematics
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Nearly tight approximability results for minimum biclique cover and partition
• On the parameterized complexity of biclique cover and partition
• The \(\mathbb{F}_p\) span of the incidence matrix of a finite projective plane

Cited in

(3)

• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• Weighted 2-sections and hypergraph reconstruction
• Edge clique partition and cover beyond independence

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 Q6068263)