Efficient algorithms for listing unlabeled graphs

DOI10.1016/0196-6774(92)90009-2MaRDI QIDQ3990619zbMATH OpenOpenAlexFDO

Authors 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

graph generationpolynomial delay

Mathematics Subject Classification ID

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

Recommendations

• Uniform generation of unlabelled graphs
• The random selection of unlabeled graphs
• Generating Random Unlabelled Graphs
• Cograph generation with linear delay
• Algorithms for generating labelled graphs with given degree

Cited in

(6)

• Algorithms for generating labelled graphs with given degree
• Listing graphs that satisfy first-order sentences
• Multi-way set enumeration in weight tensors
• Efficient Algorithms for Listing Combinatorial Structures
• Uniform generation of unlabelled graphs
• Polynomial-delay generation of functional digraphs up to isomorphism

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

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