scientific article; zbMATH DE number 6820337
From MaRDI portal
Publication:4598291
DOI10.4230/LIPIcs.ICALP.2016.148zbMath1388.68218MaRDI QIDQ4598291
Roberto Grossi, Alessio Conte, Andrea Marino, Luca Versari
Publication date: 19 December 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Related Items (21)
Proximity Search for Maximal Subgraph Enumeration ⋮ Efficient enumeration of graph orientations with sources ⋮ Efficiently enumerating all maximal cliques with bit-parallelism ⋮ Polynomial-delay and polynomial-space enumeration of large maximal matchings ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms ⋮ Listing Maximal Independent Sets with Minimal Space and Bounded Delay ⋮ A new decomposition technique for maximal clique enumeration for sparse graphs ⋮ Maximal strongly connected cliques in directed graphs: algorithms and bounds ⋮ Efficient enumeration of maximal induced bicliques ⋮ Efficient enumeration of dominating sets for sparse graphs ⋮ Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph ⋮ Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs ⋮ A fast discovery algorithm for large common connected induced subgraphs ⋮ Unnamed Item ⋮ A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number ⋮ Large-scale clique cover of real-world networks ⋮ An improved upper bound on maximal clique listing via rectangular fast matrix multiplication ⋮ Unnamed Item ⋮ On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms ⋮ Unnamed Item
This page was built for publication:
