Fast constructive and improvement heuristics for edge clique covering

DOI10.1016/J.DISOPT.2021.100628zbMATH Open1506.05177OpenAlexW3126605228MaRDI QIDQ2019428FDOQ2019428

Authors: Marcos Okamura Rodrigues 

Publication date: 21 April 2021

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2021.100628

Recommendations

• Data reduction, exact, and heuristic algorithms for clique cover
• Data reduction and exact algorithms for clique cover
• Large-scale clique cover of real-world networks
• scientific article; zbMATH DE number 7310192

zbMATH Keywords

graph algorithmsconstructive heuristicsedge clique coveringimprovement heuristics

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Clique Covering of Graphs IV. Algorithms
• Linear time algorithms on circular-arc graphs
• The approximation of maximum subgraph problems
• Applications of edge coverings by cliques
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data reduction and exact algorithms for clique cover
• The Representation of a Graph by Set Intersections
• Algorithms for compact letter displays: comparison and evaluation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
• Clique cover on sparse networks
• Data reduction, exact, and heuristic algorithms for clique cover
• Clique covering and clique partition in generalizations of line graphs

Cited In (6)

• An overview of graph covering and partitioning
• Title not available (Why is that?)
• Large-scale clique cover of real-world networks
• Known Algorithms for Edge Clique Cover are Probably Optimal
• Finding optimal triangulations parameterized by edge clique cover
• Data reduction, exact, and heuristic algorithms for clique cover

This page was built for publication: Fast constructive and improvement heuristics for edge clique covering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019428)