ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • G.2.2  (1)
Collection
Keywords
Publisher
Years
  • 1
    Electronic Resource
    Electronic Resource
    On parallelizing a greedy heuristic for finding small dominant sets (1993)
    Springer
    BIT 33 (1993), S. 57-62 
    Details
    ISSN: 1572-9125
    Keywords: F.1.3 ; F.2.2 ; G.2.2 ; Computational complexity ; analysis of algorithms ; P-completeness ; dominating sets
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We analyse a greedy heuristic for finding small dominating sets in graphs: bounds on the size of the dominating set so produced had previously been derived in terms of the size of a smallest dominating set and the number of vertices and edges in the graph, respectively, We show that computing the resulting small dominating set isP-hard and so cannot be done efficiently in parallel (in the context of the PRAM model of parallel computation). We also consider a related non-deterministic greedy heuristic.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01990343
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...