Capacity complexity of the accessibility problem for frontally bounded digraphs

MaRDI QIDQ3650043zbMATH OpenFDO

Authors V. V. Lepin

Publication date 11 December 2009

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
• scientific article; zbMATH DE number 8782
• The computational complexity of optimal blocking of vertices in the digraph
• On the parallel complexity of digraph reachability
• scientific article; zbMATH DE number 4001498

Cited in

(2)

• scientific article; zbMATH DE number 4001498 (Why is no real title available?)
• Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree

This page was built for publication: Capacity complexity of the accessibility problem for frontally bounded digraphs

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