Most uniform path partitioning and its use in image processing
- 1 April 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 42 (2-3) , 227-256
- https://doi.org/10.1016/0166-218x(93)90048-s
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Fair dissections of spiders, worms, and caterpillarsNetworks, 1990
- Efficient implementation of a shifting algorithmDiscrete Applied Mathematics, 1985
- Amortized Computational ComplexitySIAM Journal on Algebraic Discrete Methods, 1985
- Balanced optimization problemsOperations Research Letters, 1984
- Circuit partitioning with size and connection constraintsNetworks, 1983
- Shifting algorithms for tree partitioning with general weighting functionsJournal of Algorithms, 1983
- A Shifting Algorithm for Min-Max Tree PartitioningJournal of the ACM, 1982
- Max-Min Tree PartitioningJournal of the ACM, 1981
- Meet-distributive lattices and the anti-exchange closureAlgebra universalis, 1980
- A Linear Tree Partitioning AlgorithmSIAM Journal on Computing, 1977