Spanning Distribution Trees of Graphs

DOI10.1007/978-3-642-38756-2_17zbMath1303.90118OpenAlexW2404364260MaRDI QIDQ5405926

Masaki Kawabata, Takao Nishizeki

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_17

zbMATH Keywords

flowpartial \(k\)-treeseries-parallel graphdemandsupplyspanning distribution tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (3)

A Simple 2-Approximation for Maximum-Leaf Spanning Tree ⋮ A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs ⋮ A strongly polynomial time algorithm for the maximum supply rate problem on trees

This page was built for publication: Spanning Distribution Trees of Graphs