Polynomial space polynomial delay algorithms for listing families of graphs
From MaRDI portal
Publication:5248489
DOI10.1145/167088.167160zbMath1310.68108OpenAlexW2018330967MaRDI QIDQ5248489
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167160
Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence ⋮ Automated generation of conjectures on forbidden subgraph characterization
This page was built for publication: Polynomial space polynomial delay algorithms for listing families of graphs
