On the hardness of Reachability Reduction

DOI10.1007/978-3-030-26176-4_37MaRDI QIDQ2300061zbMATH OpenOpenAlexFDO

Authors Dongjing Miao, Zhipeng Cai

Publication date 24 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-26176-4_37

zbMATH Keywords

complexitygraph cutreachability reduction

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• Maximum reachability preserved graph cut
• On the parallel complexity of digraph reachability
• On the hardness of computing maximum self-reduction sequences
• Connectivity vs. reachability
• Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case

This page was built for publication: On the hardness of Reachability Reduction

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