Parallel enumeration of degree sequences of simple graphs

MaRDI QIDQ5167101zbMATH OpenFDO

Authors Antal Iványi, Loránd Lucz, Tamás Matuszka, Shariefuddin Pirzada

Publication date 9 July 2014

zbMATH Keywords

simple directed graphsapproximate filtering algorithmsapproximate reconstruction algorithmslinear Havel-Hakimi algorithm

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Parallel enumeration of degree sequences
• Parallel enumeration of degree sequences of simple graphs. II
• Realizing Degree Sequences in Parallel
• On Erdös-Gallai and Havel-Hakimi algorithms
• Efficient counting of degree sequences

Cited in

(8)

• A recurrence template for several parameters in series-parallel graphs
• Parallel enumeration of degree sequences
• Realizing Degree Sequences in Parallel
• Parallel enumeration of degree sequences of simple graphs. II
• Diamond-free degree sequence
• Efficient counting of degree sequences
• Exhaustive community enumeration in parallel
• scientific article; zbMATH DE number 5863491 (Why is no real title available?)

This page was built for publication: Parallel enumeration of degree sequences of simple graphs

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