Fast constructive and improvement heuristics for edge clique covering

DOI10.1016/J.DISOPT.2021.100628MaRDI QIDQ2019428zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

constructive heuristicsedge clique coveringgraph algorithmsimprovement heuristics

Mathematics Subject Classification ID

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) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

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

Cites work

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

Cited in

(7)

• An overview of graph covering and partitioning
• Finding optimal triangulations parameterized by edge clique cover
• Large-scale clique cover of real-world networks
• Data reduction, exact, and heuristic algorithms for clique cover
• scientific article; zbMATH DE number 7764113 (Why is no real title available?)
• A branch-and-cut algorithm for nesting problems with guillotine constraints
• A parallel branch-and-bound-and-check algorithm for nesting

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)