New polynomial delay bounds for maximal subgraph enumeration by proximity search

DOI10.1145/3313276.3316402zbMath1433.68288OpenAlexW2951327881MaRDI QIDQ5212857

Alessio Conte, Takeaki Uno

Publication date: 30 January 2020

Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11568/1028305

zbMATH Keywords

graph enumerationproximity searchpolynomial delay

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Proximity Search for Maximal Subgraph Enumeration ⋮ Polynomial-delay and polynomial-space enumeration of large maximal matchings ⋮ Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes ⋮ Efficiently enumerating minimal triangulations ⋮ Maximal strongly connected cliques in directed graphs: algorithms and bounds ⋮ Efficient enumeration of maximal induced bicliques ⋮ Unnamed Item ⋮ A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number

This page was built for publication: New polynomial delay bounds for maximal subgraph enumeration by proximity search