Some observations on the computational complexity of graph accessibility problem. (Extended abstract)

DOI10.1007/3-540-48686-0_2MaRDI QIDQ4938656zbMATH OpenFDO

Authors Jun Tarui, Seinosuke Toda

Publication date 20 July 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48686-0_2

Mathematics Subject Classification ID

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

This page was built for publication: Some observations on the computational complexity of graph accessibility problem. (Extended abstract)

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