scientific article; zbMATH DE number 7278028

DOI10.4230/LIPIcs.ISAAC.2017.23zbMath1457.68211MaRDI QIDQ5136240

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

Publication date: 25 November 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

directed graphscommunity structurebounded delayenumeration algorithmsnetwork analytics

Mathematics Subject Classification ID

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

Related Items (1)

Maximal strongly connected cliques in directed graphs: algorithms and bounds

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
• Directing Road Networks by Listing Strong Orientations
• Clique Relaxation Models in Social Network Analysis
• Bounded Arboricity to Determine the Local Structure of Sparse Graphs
• A New Algorithm for Generating All the Maximal Independent Sets
• Listing All Maximal Cliques in Large Sparse Real-World Graphs
• Algorithm Theory - SWAT 2004
• The Enumeration of Maximal Cliques of Large Graphs
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs

This page was built for publication: