Parallel enumeration of degree sequences

MaRDI QIDQ2834258zbMATH OpenFDO

Authors Antal Iványi, Zoltán Kása

Publication date 25 November 2016

Published in Alkalmazott Matematikai Lapok. A Magyar Tudomanyos Akademia. Matematikai es Fizikai Tudomanyok Osztalyanak Közlemenyei (Search for Journal in Brave)

zbMATH Keywords

degree sequencessimple graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Recommendations

• Parallel enumeration of degree sequences of simple graphs
• Realizing Degree Sequences in Parallel
• Parallel enumeration of degree sequences of simple graphs. II
• Sequential and parallel enumeration
• Efficient counting of degree sequences
• Parallel degree computation for binomial systems
• Parallel enumeration of triangulations
• Parallel Generation of ℓ-Sequences
• Parallel generation of P-sequences
• Degree sequences of multigraphs

Cited in

(9)

• Diamond-free degree sequence
• On partial sorting in restricted rounds
• Sequential and parallel enumeration
• Recognition of split-graphic sequences
• Realizing Degree Sequences in Parallel
• Parallel recognition of the consecutive ones property with applications
• Parallel enumeration of degree sequences of simple graphs
• 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

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