Min-cut partitioning on underlying tree and graph structures

DOI10.1109/12.494104zbMath1048.68547OpenAlexW2159555422MaRDI QIDQ4420947

Spyros Tragoudas

Publication date: 1996

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.494104

zbMATH Keywords

network partitioningiterative improvement

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: Min-cut partitioning on underlying tree and graph structures