Highly parallelizable problems on sorted intervals

DOI10.1016/0167-8191(94)00102-GMaRDI QIDQ673932zbMATH OpenOpenAlexWikidataFDO

Authors Juan-Miguel Gracia

Publication date 28 February 1997

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(94)00102-g

zbMATH Keywords

Interval graphCombinatorial optimization problemCRCW PRAM modelDepth first search treeHighly parallelizableMinimum connected dominating setMinimum total dominating set

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• scientific article; zbMATH DE number 3892606
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
• Parallel algorithms on interval graphs
• Designing efficient parallel algorithms on interval graphs
• scientific article; zbMATH DE number 123468

Cited in

(6)

• scientific article; zbMATH DE number 4037198 (Why is no real title available?)
• scientific article; zbMATH DE number 3892606 (Why is no real title available?)
• Parallel vertex colouring of interval graphs
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
• Tight Bounds on the Complexity of Parallel Sorting
• Unified all-pairs shortest path algorithms in the chordal hierarchy

This page was built for publication: Highly parallelizable problems on sorted intervals

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