scientific article; zbMATH DE number 6850332
From MaRDI portal
Publication:4607901
zbMath1403.68167MaRDI QIDQ4607901
Saket Saurabh, Tien-Nam Le, Daniel Lokshtanov, Meirav Zehavi, Steéphan Thomassé
Publication date: 15 March 2018
Full work available at URL: http://dl.acm.org/citation.cfm?id=3175290
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 (6)
The maximum independent union of cliques problem: complexity and exact approaches ⋮ Packing arc-disjoint cycles in tournaments ⋮ Unnamed Item ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ Vertex deletion on split graphs: beyond 4-hitting set ⋮ Packing Arc-Disjoint Cycles in Tournaments
This page was built for publication:
