scientific article; zbMATH DE number 8782

MaRDI QIDQ3971271zbMATH OpenFDO

Authors Iain A. Stewardt

Publication date 25 June 1992

zbMATH Keywords

graph accessibility problem

Mathematics Subject Classification ID

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

Recommendations

• Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
• scientific article; zbMATH DE number 4209586
• scientific article; zbMATH DE number 3987266
• scientific article; zbMATH DE number 17815

Cited in

(4)

• Capacity complexity of the accessibility problem for frontally bounded digraphs
• scientific article; zbMATH DE number 2171034 (Why is no real title available?)
• 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:

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