scientific article; zbMATH DE number 7764108

DOI10.4230/lipics.ipec.2020.17arXiv2002.07761MaRDI QIDQ6068263

Ashutosh Rai, Davis Issac, Andreas Emil Feldmann

Publication date: 13 November 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fixed-parameter tractabilitykernelizationedge clique partition

Mathematics Subject Classification ID

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

Related Items (1)

Weighted 2-sections and hypergraph reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• Applications of edge coverings by cliques
• A contribution to the Zarankiewicz problem
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Covering graphs with few complete bipartite subgraphs
• The \(\mathbb{F}_p\) span of the incidence matrix of a finite projective plane
• Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
• Edge Clique Partition of K 4-Free and Planar Graphs
• Known Algorithms for Edge Clique Cover are Probably Optimal
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• On the Parameterized Complexity of Biclique Cover and Partition
• Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
• Clique Cover on Sparse Networks
• Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
• Discovery Science
• Bounding the Running Time of Algorithms for Scheduling and Packing Problems

This page was built for publication: