Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs - MaRDI portal

Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs

From MaRDI portal

Publication:4696644

Jump to:navigation, search

DOI10.1006/JAGM.1993.1017zbMath0768.68155OpenAlexW2081804932MaRDI QIDQ4696644

Philip N. Klein

Publication date: 29 June 1993

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1993.1017

zbMATH Keywords

reachability directed graph parallelization sparse graphs hybrid algorithm preprocessing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Nearly Work-Efficient Parallel Algorithm for Digraph Reachability

This page was built for publication: Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4696644&oldid=18929720"