Linear Problem Kernels for Planar Graph Problems with Small Distance Property
From MaRDI portal
Publication:3088074
DOI10.1007/978-3-642-22993-0_53zbMath1343.68123OpenAlexW181736346MaRDI QIDQ3088074
Jianxin Wang, Yongjie Yang, Jiong Guo, Jian'er Chen
Publication date: 17 August 2011
Published in: Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22993-0_53
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Related Items (2)
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs ⋮ A \(9k\) kernel for nonseparating independent set in planar graphs
This page was built for publication: Linear Problem Kernels for Planar Graph Problems with Small Distance Property
