Connectivity vs. reachability

DOI10.1016/0890-5401(91)90065-AzbMath0723.68046OpenAlexW2055842100MaRDI QIDQ757048

Marek Chrobak, Tomasz Radzik, Howard J. Karloff

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90065-a

zbMATH Keywords

reachabilityconnectivityoraclequeries

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The complexity of graph connectivity

Cites Work

• A generalized model for understanding evasiveness
• On the Complexity of Timetable and Multicommodity Flow Problems

This page was built for publication: Connectivity vs. reachability