Fast constructive and improvement heuristics for edge clique covering

DOI10.1016/j.disopt.2021.100628zbMath1506.05177OpenAlexW3126605228MaRDI QIDQ2019428

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

graph algorithmsconstructive heuristicsedge clique coveringimprovement heuristics

Mathematics Subject Classification ID

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

Related Items (1)

An overview of graph covering and partitioning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complete width and edge clique cover problems
• Applications of edge coverings by cliques
• Algorithms for compact letter displays: comparison and evaluation
• Linear time algorithms on circular-arc graphs
• 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
• The approximation of maximum subgraph problems
• Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
• Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
• Clique Cover on Sparse Networks
• Data reduction and exact algorithms for clique cover
• The Representation of a Graph by Set Intersections

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