Structurally parameterized \(d\)-Scattered Set

DOI10.1007/978-3-030-00256-5_24OpenAlexW2963196712MaRDI QIDQ1627183

Vangelis Th. Paschos, Ioannis Katsikarelis, Michael Lampis

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1709.02180

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (9)

Fast Algorithms for Join Operations on Tree Decompositions ⋮ Grundy Distinguishes Treewidth from Pathwidth ⋮ Parameterized (Approximate) Defective Coloring ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation ⋮ Vertex cover at distance on \(H\)-free graphs ⋮ A generic convolution algorithm for join operations on tree decompositions

This page was built for publication: Structurally parameterized \(d\)-Scattered Set