Highly parallelizable problems on sorted intervals

DOI10.1016/0167-8191(94)00102-GzbMATH Open0875.68316OpenAlexW2009131868WikidataQ126388854 ScholiaQ126388854MaRDI QIDQ673932FDOQ673932

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

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

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)

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)