Realizing Degree Sequences in Parallel

DOI10.1137/S0895480194267932MaRDI QIDQ4881296zbMATH OpenOpenAlexFDO

Authors Anil Maheshwari, S. R. Arikati

Publication date 12 September 1996

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480194267932

zbMATH Keywords

parallel algorithmgraph algorithmsdegree sequence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Parallel enumeration of degree sequences
• scientific article; zbMATH DE number 3991266
• Parallelization of implementations of purely sequential algorithms
• Parallel degree computation for binomial systems
• Parallel enumeration of degree sequences of simple graphs
• On parallel versus sequential approximation
• Parallel generation of P-sequences
• Publication:3495616
• Parallelizing sequential graph computations
• scientific article; zbMATH DE number 4195879

Cited in

(8)

• Fault-tolerant graph realizations in the congested clique
• Linear-time certifying algorithms for near-graphical sequences
• Graph realizations: maximum degree in vertex neighborhoods
• scientific article; zbMATH DE number 2227382 (Why is no real title available?)
• On parallel complexity of maximum \(f\)-matching and the degree sequence problem
• Parallel enumeration of degree sequences of simple graphs
• Parallel enumeration of degree sequences
• Efficiently realizing interval sequences

This page was built for publication: Realizing Degree Sequences in Parallel

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