Highly parallelizable problems on sorted intervals
From MaRDI portal
Publication:673932
DOI10.1016/0167-8191(94)00102-GzbMath0875.68316MaRDI QIDQ673932
Publication date: 28 February 1997
Published in: Parallel Computing (Search for Journal in Brave)
Interval graph; Combinatorial optimization problem; CRCW PRAM model; Depth first search tree; Highly parallelizable; Minimum connected dominating set; Minimum total dominating set
68P10: Searching and sorting
Related Items