Pages that link to "Item:Q3596718"
From MaRDI portal
The following pages link to Partitioning a Weighted Tree to Subtrees of Almost Uniform Size (Q3596718):
Displaying 18 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- Edge separators for quasi-binary trees (Q299105) (← links)
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- A tight bound on the min-ratio edge-partitioning problem of a tree (Q608252) (← links)
- A shifting algorithm for constrained min-max partition on trees (Q686520) (← links)
- Efficient algorithms for a graph partitioning problem (Q777267) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- Most uniform path partitioning and its use in image processing (Q1803677) (← links)
- A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- On the uniform edge-partition of a tree (Q2370420) (← links)
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693) (← links)
- Partitioning a weighted tree into subtrees with weights in a given range (Q2428691) (← links)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- Connected bin packing problem on traceable graphs (Q3390778) (← links)
- Partitioning of biweighted trees (Q4533449) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710818) (← links)
