Most uniform path partitioning and its use in image processing
From MaRDI portal
Publication:1803677
DOI10.1016/0166-218X(93)90048-SzbMath0781.68133MaRDI QIDQ1803677
Mario Lucertini, Yehoshua Perl, Bruno Simeone
Publication date: 29 June 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
partitioning problem; image enhancement; linear-time algorithms; image degradation; grey scale transformation
68U10: Computing methodologies for image processing
68R10: Graph theory (including graph drawing) in computer science
Related Items
Balancing flexible lines for car components assembly, Unnamed Item, A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem, Max-min weight balanced connected partition, Improved algorithms for path partition and related problems, A plane graph representation of triconnected graphs, A short note on locating facilities on a path to minimize load range equity measure, A tight bound on the min-ratio edge-partitioning problem of a tree, Block partitions: an extended view, Approximation algorithm for the balanced 2-connected \(k\)-partition problem, Minimum \(L_k\) path partitioning-an illustration of the Monge property, Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches, Divider-based algorithms for hierarchical tree partitioning., Path equipartition in the Chebyshev norm, Uniform and most uniform partitions of trees, On a 2-dimensional equipartition problem, Continuous bottleneck tree partitioning problems, A shifting algorithm for continuous tree partitioning, The shifting algorithm technique for the partitioning of trees, Efficient algorithms for some path partitioning problems, Partitioning a matrix to minimize the maximum cost, On the uniform edge-partition of a tree, Partitioning a weighted tree into subtrees with weights in a given range, Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size, A robust algorithm for bisecting a triconnected graph with two resource sets, Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A shifting algorithm for constrained min-max partition on trees
- Balanced optimization problems
- Efficient implementation of a shifting algorithm
- Meet-distributive lattices and the anti-exchange closure
- Shifting algorithms for tree partitioning with general weighting functions
- Circuit partitioning with size and connection constraints
- Amortized Computational Complexity
- Max-Min Tree Partitioning
- A Shifting Algorithm for Min-Max Tree Partitioning
- Fair dissections of spiders, worms, and caterpillars
