Finding a manhattan path and related problems
- 1 September 1983
- Vol. 13 (3) , 399-409
- https://doi.org/10.1002/net.3230130308
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A fast algorithm for testing for safety and detecting deadlocks in locked transaction systemsJournal of Algorithms, 1981
- Segments, rectangles, contoursJournal of Algorithms, 1981
- Finding the contour of a union of iso-oriented rectangiesJournal of Algorithms, 1980
- On two-dimensional data organization II1Fundamenta Informaticae, 1979
- Testing for equality between maximum matching and minimum node coveringInformation Processing Letters, 1977
- Preserving order in a forest in less than logarithmic time and linear spaceInformation Processing Letters, 1977
- Preserving order in a forest in less than logarithmic timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1975
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973