Polynomial space polynomial delay algorithms for listing families of graphs

DOI10.1145/167088.167160MaRDI QIDQ5248489zbMATH OpenOpenAlexFDO

Authors Leslie Ann Goldberg

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

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited in

(2)

• Automated generation of conjectures on forbidden subgraph characterization
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence

This page was built for publication: Polynomial space polynomial delay algorithms for listing families of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5248489)