scientific article; zbMATH DE number 1979504
From MaRDI portal
Publication:4425960
zbMath1019.68044MaRDI QIDQ4425960
Ulrike Stege, Iris van Rooij, Philipp Hertel, Alex Hertel
Publication date: 14 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180249.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Mathematical psychology (91E99)
Related Items (4)
The Impact of Parameterized Complexity to Interdisciplinary Problem Solving ⋮ On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs ⋮ On the partial vertex cover problem in bipartite graphs -- a parameterized perspective ⋮ Sources of complexity in subset choice
This page was built for publication:
