The complexity of searching a graph
- 1 January 1988
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 35 (1), 18-44
- https://doi.org/10.1145/42267.42268
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Searching and pebblingTheoretical Computer Science, 1986
- A polynomial algorithm for the min-cut linear arrangement of treesJournal of the ACM, 1985
- Topological BandwidthSIAM Journal on Algebraic Discrete Methods, 1985
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted TreesSIAM Journal on Computing, 1985
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969