scientific article; zbMATH DE number 8782

zbMATH Open0744.68070MaRDI QIDQ3971271FDOQ3971271

Iain A. Stewardt

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

Recommendations

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

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)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
• Capacity complexity of the accessibility problem for frontally bounded digraphs

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)