scientific article; zbMATH DE number 7378592
From MaRDI portal
Publication:5009468
DOI10.4230/LIPIcs.IPEC.2018.6MaRDI QIDQ5009468
Torstein J. F. Strømme, Lars Jaffke, Jan Arne Telle, O-joung Kwon
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1803.03514
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
A new approach on locally checkable problems ⋮ On \(d\)-stable locally checkable problems parameterized by mim-width ⋮ Mim-width. II. The feedback vertex set problem ⋮ Distance Domination in Graphs ⋮ Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width ⋮ Mim-width. III. Graph powers and generalized distance domination problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph classes with structured neighborhoods and algorithmic applications
- Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
- On the parameterized complexity of multiple-interval graph problems
- Powers of geometric intersection graphs and dispersion algorithms
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
- On powers of \(m\)-trapezoid graphs
- On the tractability of optimization problems on \(H\)-graphs
- Mim-width. III. Graph powers and generalized distance domination problems
- Perfect codes in graphs
- The point-set embeddability problem for plane graphs
- R -Domination in Graphs
- Graph Classes: A Survey
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- An efficient algorithm to solve the distancek-domination problem on permutation graphs
- Hardness of computing width parameters based on branch decompositions over the vertex set
- On \(H\)-topological intersection graphs
This page was built for publication:
