Highly parallelizable problems on sorted intervals

DOI10.1016/0167-8191(94)00102-GzbMath0875.68316OpenAlexW2009131868WikidataQ126388854 ScholiaQ126388854MaRDI QIDQ673932

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)

Related Items (2)

Unified all-pairs shortest path algorithms in the chordal hierarchy ⋮ PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS

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