Partitioning a Weighted Tree to Subtrees of Almost Uniform Size

DOI10.1007/978-3-540-92182-0_20MaRDI QIDQ3596718zbMATH OpenOpenAlexFDO

Authors Takehiro Ito, Takeaki Uno, Xiao Zhou, Takao Nishizeki

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-92182-0_20

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Partitioning a weighted tree into subtrees with weights in a given range
• Partitioning of biweighted trees
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
• Graph-Theoretic Concepts in Computer Science
• Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
• Algorithms for uniform centered partitions of trees
• A bottom‐up algorithm for weight‐ and height‐bounded minimal partition of trees
• scientific article; zbMATH DE number 3866593
• On tree partitions
• Partitioning graphs of bounded tree-width

Cited in

(20)

• Uniform and most uniform partitions of trees
• Most uniform path partitioning and its use in image processing
• A linear-time algorithm for finding an edge-partition with max-min ratio at most two
• On finding connected balanced partitions of trees
• On the uniform edge-partition of a tree
• Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
• Partitioning a weighted tree into subtrees with weights in a given range
• Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size
• Cardinality constrained connected balanced partitions of trees under different criteria
• A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
• Edge separators for quasi-binary trees
• Connected bin packing problem on traceable graphs
• Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size
• scientific article; zbMATH DE number 3970117 (Why is no real title available?)
• Partitioning of biweighted trees
• Algorithms for uniform centered partitions of trees
• Graph-Theoretic Concepts in Computer Science
• A tight bound on the min-ratio edge-partitioning problem of a tree
• A shifting algorithm for constrained min-max partition on trees
• Efficient algorithms for a graph partitioning problem

This page was built for publication: Partitioning a Weighted Tree to Subtrees of Almost Uniform Size

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596718)