scientific article
From MaRDI portal
Publication:3341921
zbMath0549.68062MaRDI QIDQ3341921
Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmandakis, Christos H. Papadimitriou
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (14)
Parameterized complexity dichotomy for \textsc{Steiner Multicut} ⋮ The multi-multiway cut problem ⋮ Parameterized complexity of weighted multicut in trees ⋮ Parameterized complexity of multicut in weighted trees ⋮ Multicut Is FPT ⋮ Models and methods for solving the problem of network vulnerability ⋮ Restricted vertex multicut on permutation graphs ⋮ Multiway cuts in directed and node weighted graphs ⋮ Primal-dual approximation algorithms for integral flow and multicut in trees ⋮ An FPT algorithm for planar multicuts with sources and sinks on the outer face ⋮ On the hardness of finding near-optimal multicuts in directed acyclic graphs ⋮ Correlation clustering in general weighted graphs ⋮ Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth ⋮ A simple algorithm for multicuts in planar graphs with outer terminals
This page was built for publication:
