Parametric Power Supply Networks

DOI10.1007/978-3-642-38768-5_23zbMath1381.68227OpenAlexW6306728MaRDI QIDQ4925242

Shiho Morishita, Takao Nishizeki

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38768-5_23

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

A heuristic approach for dividing graphs into bi-connected components with a size constraint ⋮ Partitioning of supply/demand graphs with capacity limitations: an ant colony approach ⋮ A mixed integer program for partitioning graphs with supply and demand emphasizing sparse graphs ⋮ A heuristic method for solving the problem of partitioning graphs with supply and demand

Cites Work

• Unnamed Item
• Partitioning graphs of supply and demand
• Approximability of partitioning graphs with supply and demand
• Minimum cost partitions of trees with supply and demand
• Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
• A Fast Parametric Maximum Flow Algorithm and Applications
• PARTITIONING TREES OF SUPPLY AND DEMAND
• Parametric Network Flows

This page was built for publication: Parametric Power Supply Networks