Decomposition of a network into minimally connected parts
From MaRDI portal
Publication:759664
zbMath0553.90102MaRDI QIDQ759664
Publication date: 1984
Published in: Automation and Remote Control (Search for Journal in Brave)
connected subgraphsadaptive branching strategybounding principledecomposition of a weighted graphimplicit enumeration algorithmminimal weight of the external edgesmulticomponent network
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic network models in operations research (90B10)
This page was built for publication: Decomposition of a network into minimally connected parts