Near Optimal Parallel Algorithms for Dynamic DFS in Undirected Graphs

Depth first search (DFS) tree is a fundamental data structure for solving graph problems. The classical algorithm [SiComp74] for building a DFS tree requires \(O(m+n)\) time for a given graph \(G\) having \(n\) vertices and \(m\) edges. Recently, Baswana et al. [SODA16] presented a simple algorithm...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavný autor:	Khan, Shahbaz
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 10.05.2017
Predmet:	Algorithms Apexes Computation Data structures Fault tolerance Graph theory Processors
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!