Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

Minimum spanning tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent problems in biology and medicine such as cancer detection, medical imaging, and proteomics, and national security and bio...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of parallel and distributed computing Ročník 66; číslo 11; s. 1366 - 1378
Hlavní autoři:	Bader, David A., Cong, Guojing
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 01.11.2006 Elsevier
Témata:	Applied sciences Computer science; control theory; systems Computer systems and distributed systems. User interface Connectivity Exact sciences and technology High-performance algorithm engineering Parallel graph algorithms Software High-performance algorithm engineering Connectivity Parallel graph algorithms Sparse graph Circuit design Forest(graph) Combinatorial problem Biology Combinatorial optimization Distributed computing Periodic structure Minimum spanning tree MST Multiprocessor Cancerology Fast algorithm Medical application Human Parallel algorithm Terrorism Distributed system Malignant tumor Bioterrorism Communication network Random graph Biological warfare Medical imagery Wireless network Web site Shared memory Firm Regular graph
ISSN:	0743-7315, 1096-0848
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!