scientific article; zbMATH DE number 1354124
From MaRDI portal
Publication:4268437
zbMath0925.05062MaRDI QIDQ4268437
Anders Dessmark, Andrzej Lingas, Klaus Jansen
Publication date: 31 October 1999
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
On the parameterized complexity of maximum degree contraction problem ⋮ The maximum independent union of cliques problem: complexity and exact approaches ⋮ Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes ⋮ Maximum weight t-sparse set problem on vector-weighted graphs ⋮ Approximation algorithms for finding and partitioning unit-disk graphs into co-\(k\)-plexes ⋮ On structural parameterizations of the bounded-degree vertex deletion problem ⋮ On the Parameterized Complexity of Maximum Degree Contraction Problem. ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Unnamed Item ⋮ An improved approximation for maximum \(k\)-dependent set on bipartite graphs ⋮ A new approach for approximating node deletion problems ⋮ On bounded-degree vertex deletion parameterized by treewidth
This page was built for publication:
