scientific article; zbMATH DE number 7205211

DOI10.4230/LIPIcs.IPEC.2017.27zbMath1448.05191MaRDI QIDQ5111887

George Manoussakis

Publication date: 27 May 2020

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

zbMATH Keywords

maximal cliques\(k\)-degenerate graphsenumeration algorithms

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Density (toughness, etc.) (05C42)

Related Items (2)

A new decomposition technique for maximal clique enumeration for sparse graphs ⋮ Efficient enumeration of maximal induced bicliques

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• The worst-case time complexity for generating all maximal cliques and computational experiments
• A note on the problem of reporting maximal cliques
• On generating all maximal independent sets
• An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
• On-line construction of suffix trees
• Fast maximal cliques enumeration in sparse graphs
• Arboricity and Subgraph Listing Algorithms
• A Space-Economical Suffix Tree Construction Algorithm
• A New Algorithm for Generating All the Maximal Independent Sets
• Algorithms on Strings, Trees and Sequences
• Listing All Maximal Cliques in Large Sparse Real-World Graphs
• Algorithm Theory - SWAT 2004
• k-Degenerate Graphs
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs

This page was built for publication: