Efficient Algorithms for k-Terminal Cuts on Planar Graphs

Authors:

Publisher website

10 October 2003

journal article
Published by Springer Nature in Algorithmica

Vol. 38 (2) , 299-316
DOI:10.1007/s00453-003-1061-2

Abstract

No abstract available

Keywords

Cited by 20 articles