Pages that link to "Item:Q2370420"

The following pages link to On the uniform edge-partition of a tree (Q2370420):

Displaying 13 items.

• 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 note on the minimum bounded edge-partition of a tree (Q967344) (← links)
• Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
• On a tree-cutting problem of P. Ash (Q1182874) (← links)
• Uniform and most uniform partitions of trees (Q1756346) (← links)
• A linear-time algorithm for finding an edge-partition with max-min ratio at most two (Q1949099) (← links)
• Tree edge decomposition with an application to minimum ultrametric tree approximation (Q2369981) (← links)
• A Rooted-Forest Partition with Uniform Vertex Demand (Q3404442) (← links)
• (Q3976622) (← links)
• A minimum spanning tree equipartition algorithm for microaggregation (Q5130200) (← links)
• Approximate envy-freeness in graphical cake cutting (Q6611013) (← links)