Pages that link to "Item:Q1803677"

The following pages link to Most uniform path partitioning and its use in image processing (Q1803677):

Displaying 12 items.

• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
• Max-min weight balanced connected partition (Q386475) (← links)
• Improved algorithms for path partition and related problems (Q408433) (← links)
• A plane graph representation of triconnected graphs (Q410724) (← links)
• A short note on locating facilities on a path to minimize load range equity measure (Q512998) (← links)
• A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
• Block partitions: an extended view (Q722349) (← links)
• Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
• Minimum \(L_k\) path partitioning-an illustration of the Monge property (Q924884) (← links)
• Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
• Uniform and most uniform partitions of trees (Q1756346) (← links)
• Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs (Q6496547) (← links)