Reachability Problems on Directed Graphs

DOI10.1007/978-3-540-92182-0_3zbMATH Open1183.68437OpenAlexW1502981980MaRDI QIDQ3596701FDOQ3596701

Authors: Robert E. Tarjan 

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_3

Recommendations

• Dynamic complexity of directed reachability and other problems
• On the parallel complexity of digraph reachability
• Reachability Problems: An Update
• Improved Dynamic Reachability Algorithms for Directed Graphs
• A new approach to incremental cycle detection and related problems

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• Backtracking problem in the traversal of an unknown directed graph by a finite robot
• Average case analysis of fully dynamic reachability for directed graphs
• Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs
• Spanners and Reachability Oracles for Directed Transmission Graphs
• Fault tolerant reachability for directed graphs
• Reachability problems in edge-colored digraphs
• On reachability in graphs with obstacles

This page was built for publication: Reachability Problems on Directed Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596701)