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...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Author:	Khan, Shahbaz
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 10.05.2017
Subjects:	Algorithms Apexes Computation Data structures Fault tolerance Graph theory Processors
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!