scientific article; zbMATH DE number 7650221
From MaRDI portal
Publication:5875545
DOI10.4230/LIPIcs.IPEC.2019.13MaRDI QIDQ5875545
Hiroshi Eto, Tesshu Hanaka, Yasuaki Kobayashi, Yusuke Kobayashi
Publication date: 3 February 2023
Full work available at URL: https://arxiv.org/abs/1908.03389
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68Wxx) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (11)
Computing L(p,1)-Labeling with Combined Parameters ⋮ Finding a maximum minimal separator: graph classes and fixed-parameter tractability ⋮ Computing the largest bond and the maximum connected cut of a graph ⋮ On the bond polytope ⋮ The influence of maximum \((s,t)\)-cuts on the competitiveness of deterministic strategies for the Canadian traveller problem ⋮ Computing \(L(p, 1)\)-labeling with combined parameters ⋮ In)approximability of Maximum Minimal FVS ⋮ (In)approximability of maximum minimal FVS ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation ⋮ Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation ⋮ More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints
This page was built for publication:
