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 problemimage enhancementlinear-time algorithmsimage degradationgrey scale transformation
Computing methodologies for image processing (68U10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (35)
A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem ⋮ On the uniform edge-partition of a tree ⋮ An overview of graph covering and 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 ⋮ Approximation algorithms for the maximum bounded connected bipartition problem ⋮ A tight bound on the min-ratio edge-partitioning problem of a tree ⋮ Metaheuristics for the minimum gap graph partitioning problem ⋮ Max-min weight balanced connected partition ⋮ Improved algorithms for path partition and related problems ⋮ Approximation and parameterized algorithms for balanced connected partition problems ⋮ Approximation algorithm for the balanced 2-connected \(k\)-partition problem ⋮ A plane graph representation of triconnected graphs ⋮ Balanced connected partitions of graphs: approximation, parameterization and lower bounds ⋮ Partitioning a weighted tree into subtrees with weights in a given range ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ Divider-based algorithms for hierarchical tree partitioning. ⋮ Minimum \(L_k\) path partitioning-an illustration of the Monge property ⋮ Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size ⋮ A short note on locating facilities on a path to minimize load range equity measure ⋮ Uniform and most uniform partitions of trees ⋮ Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches ⋮ Balancing flexible lines for car components assembly ⋮ Block partitions: an extended view ⋮ Partitioning a graph into balanced connected classes: formulations, separation and experiments ⋮ Approximation algorithms for maximally balanced connected graph partition ⋮ Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries ⋮ On a 2-dimensional equipartition problem ⋮ Unnamed Item ⋮ Path equipartition in the Chebyshev norm ⋮ Continuous bottleneck tree partitioning problems ⋮ A robust algorithm for bisecting a triconnected graph with two resource sets ⋮ A shifting algorithm for continuous tree partitioning ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Most uniform path partitioning and its use in image processing
