Efficient algorithms for listing unlabeled graphs

DOI10.1016/0196-6774(92)90009-2zbMath0770.68059OpenAlexW2020622242MaRDI QIDQ3990619

Leslie Ann Goldberg

Publication date: 28 June 1992

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(92)90009-2

zbMATH Keywords

polynomial delaygraph generation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Listing graphs that satisfy first-order sentences ⋮ Multi-way set enumeration in weight tensors

This page was built for publication: Efficient algorithms for listing unlabeled graphs