Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition

DOI10.1023/A:1021994406231zbMath1046.90010OpenAlexW340373535MaRDI QIDQ1411337

Sachin B. Patkar, H. Narayanan

Publication date: 27 October 2003

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021994406231

zbMATH Keywords

networkgraphon-line algorithmstrengthpolymatroidreinforcementPrincipal Partition

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (1)

A faster algorithm for computing the principal sequence of partitions of a graph

This page was built for publication: Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition