Parallel enumeration of degree sequences of simple graphs

zbMATH Open1305.05089MaRDI QIDQ5167101FDOQ5167101

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

Publication date: 9 July 2014

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

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)

Cited In (8)

• Diamond-free degree sequence
• A recurrence template for several parameters in series-parallel graphs
• Exhaustive community enumeration in parallel
• Realizing Degree Sequences in Parallel
• Title not available (Why is that?)
• Parallel enumeration of degree sequences
• Efficient counting of degree sequences
• Parallel enumeration of degree sequences of simple graphs. II

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)