A new algorithm to compute vertex cutsets in a graph

DOI10.1016/0045-7906(81)90009-4zbMath0478.68070OpenAlexW1964674774MaRDI QIDQ1161296

Bhabani P. Sinha, Pradip K. Srimani, Danda De

Publication date: 1981

Published in: Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7906(81)90009-4

zbMATH Keywords

symmetric graphproper flow pathsvertex weighted communication nets

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: A new algorithm to compute vertex cutsets in a graph