A polynomial algorithm for deciding the validity of an electrical distribution tree

DOI10.1016/j.ipl.2022.106249zbMath1486.90056OpenAlexW4205334787MaRDI QIDQ2122795

Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser, Dominique Barith

Publication date: 7 April 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106249

zbMATH Keywords

computational complexitydynamic programminggraph algorithmselectrical network flow

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)

Cites Work

• Optimisation of electrical network configuration: complexity and algorithms for ring topologies
• Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs

This page was built for publication: A polynomial algorithm for deciding the validity of an electrical distribution tree