Pages that link to "Item:Q1070825"
From MaRDI portal
The following pages link to Efficient implementation of a shifting algorithm (Q1070825):
Displaying 13 items.
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- A shifting algorithm for constrained min-max partition on trees (Q686520) (← links)
- Divider-based algorithms for hierarchical tree partitioning. (Q1427182) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- Most uniform path partitioning and its use in image processing (Q1803677) (← links)
- On a 2-dimensional equipartition problem (Q1806658) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- A shifting algorithm for continuous tree partitioning (Q1850820) (← links)
- The shifting algorithm technique for the partitioning of trees (Q1900135) (← links)
- Partitioning a matrix to minimize the maximum cost (Q1900148) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Minmax centered \(k\)-partitioning of trees and applications to sink evacuation with dynamic confluent flows (Q6107888) (← links)
