Pages that link to "Item:Q2428691"
From MaRDI portal
The following pages link to Partitioning a weighted tree into subtrees with weights in a given range (Q2428691):
Displaying 13 items.
- Complexity of splits reconstruction for low-degree trees (Q476307) (← links)
- A shifting algorithm for constrained min-max partition on trees (Q686520) (← links)
- Efficient algorithms for a graph partitioning problem (Q777267) (← links)
- A short note on the weighted sub-partition mean of integers (Q1038106) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size (Q2466001) (← links)
- A note on weighted rooted trees (Q2515593) (← links)
- Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
- Partitioning a Weighted Tree to Subtrees of Almost Uniform Size (Q3596718) (← links)
- Partitioning of biweighted trees (Q4533449) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710818) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
