Most uniform path partitioning and its use in image processing
From MaRDI portal
(Redirected from Publication:1803677)
Recommendations
Cites work
- scientific article; zbMATH DE number 3900665 (Why is no real title available?)
- scientific article; zbMATH DE number 3688765 (Why is no real title available?)
- scientific article; zbMATH DE number 3598539 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Shifting Algorithm for Min-Max Tree Partitioning
- A shifting algorithm for constrained min-max partition on trees
- Amortized Computational Complexity
- Balanced optimization problems
- Circuit partitioning with size and connection constraints
- Efficient implementation of a shifting algorithm
- Fair dissections of spiders, worms, and caterpillars
- Max-Min Tree Partitioning
- Meet-distributive lattices and the anti-exchange closure
- Shifting algorithms for tree partitioning with general weighting functions
Cited in
(37)- Partition into almost straight trails
- An overview of graph covering and partitioning
- Improved algorithms for path partition and related problems
- A plane graph representation of triconnected graphs
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
- scientific article; zbMATH DE number 2230227 (Why is no real title available?)
- Minimum \(L_k\) path partitioning-an illustration of the Monge property
- Efficient algorithms for some path partitioning problems
- Divider-based algorithms for hierarchical tree partitioning.
- Political districting for elections to the German Bundestag: an optimization-based multi-stage heuristic respecting administrative boundaries
- Block partitions: an extended view
- Continuous bottleneck tree partitioning problems
- Uniform and most uniform partitions of trees
- Path equipartition in the Chebyshev norm
- Partitioning a graph into balanced connected classes: formulations, separation and experiments
- The shifting algorithm technique for the partitioning of trees
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions
- A tight bound on the min-ratio edge-partitioning problem of a tree
- Partitioning a weighted tree into subtrees with weights in a given range
- Approximation algorithm for the balanced 2-connected k-partition problem
- A robust algorithm for bisecting a triconnected graph with two resource sets
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
- On a 2-dimensional equipartition problem
- A shifting algorithm for continuous tree partitioning
- Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
- Approximation algorithms for maximally balanced connected graph partition
- Approximation algorithms for the maximum bounded connected bipartition problem
- On the uniform edge-partition of a tree
- A short note on locating facilities on a path to minimize load range equity measure
- Approximation and parameterized algorithms for balanced connected partition problems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Partitioning a matrix to minimize the maximum cost
- Max-min weight balanced connected partition
- Balancing flexible lines for car components assembly
- Metaheuristics for the minimum gap graph partitioning problem
This page was built for publication: Most uniform path partitioning and its use in image processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803677)
