On maximal cliques with connectivity constraints in directed graphs

DOI10.4230/LIPICS.ISAAC.2017.23MaRDI QIDQ5136240zbMATH OpenFDO

Authors Alessio Conte, Mamadou Moustapha Kanté, Takeaki Uno, Kunihiro Wasa

Publication date 25 November 2020

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2017.23

zbMATH Keywords

bounded delaycommunity structuredirected graphsenumeration algorithmsnetwork analytics

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Maximal strongly connected cliques in directed graphs: algorithms and bounds
• Finding cliques in social networks: a new distribution-free model
• Multivariate algorithmics for finding cohesive subnetworks
• Listing all maximal cliques in large sparse real-world graphs
• Enumerating maximal cliques in large sparse graphs

Cites work

• A New Algorithm for Generating All the Maximal Independent Sets
• Algorithm 457: finding all cliques of an undirected graph
• Algorithm Theory - SWAT 2004
• Bounded Arboricity to Determine the Local Structure of Sparse Graphs
• Clique relaxation models in social network analysis
• Directing Road Networks by Listing Strong Orientations
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• scientific article; zbMATH DE number 1168330 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Listing all maximal cliques in large sparse real-world graphs
• On cliques in graphs
• Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
• The Enumeration of Maximal Cliques of Large Graphs

Cited in

(8)

• Finding all maximal cliques in dynamic graphs
• Enumerating maximal cliques in link streams with durations
• Multivariate algorithmics for finding cohesive subnetworks
• Maximal strongly connected cliques in directed graphs: algorithms and bounds
• Exploiting the formation of maximal cliques in social networks
• Toward optimal bounds in the congested clique, graph connectivity and MST
• Finding cliques in social networks: a new distribution-free model
• Finding cliques in social networks: a new distribution-free model

Describes a project that uses

Uses Software

• Algorithm 457

This page was built for publication: On maximal cliques with connectivity constraints in directed graphs

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