Large-scale clique cover of real-world networks

DOI10.1016/j.ic.2019.104464zbMath1436.68228OpenAlexW2971677828MaRDI QIDQ2288213

Roberto Grossi, Alessio Conte, Andrea Marino

Publication date: 17 January 2020

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2019.104464

zbMATH Keywords

graph algorithmsnetwork analysisedge clique cover

Mathematics Subject Classification ID

Analysis of algorithms (68W40) 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 (3)

Mixed-Integer programming models for irregular strip packing based on vertical slices and feasibility cuts ⋮ Finding the cyclic covers of a string ⋮ K-plex cover pooling for graph neural networks

Uses Software

• SNAP
• KronFit
• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The worst-case time complexity for generating all maximal cliques and computational experiments
• Statistical analysis of financial networks
• Algorithms for compact letter displays: comparison and evaluation
• Linear time algorithms on circular-arc graphs
• Can visibility graphs be represented compactly?
• Finding all maximal cliques in dynamic graphs
• Constructing an indeterminate string from its associated graph
• Efficiently covering complex networks with cliques of similar vertices
• Bipartite structure of all complex networks
• Known Algorithms for Edge Clique Cover are Probably Optimal
• Covering edges by cliques with regard to keyword conflicts and intersection graphs
• On the hardness of approximating minimization problems
• Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
• Data reduction and exact algorithms for clique cover
• Assignment-minimum clique coverings
• The Representation of a Graph by Set Intersections
• The Enumeration of Maximal Cliques of Large Graphs
• Algorithm 457: finding all cliques of an undirected graph

This page was built for publication: Large-scale clique cover of real-world networks