An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem

From MaRDI portal

Revision as of 05:51, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4899259

Jump to:navigation, search

DOI10.1007/978-3-642-33293-7_25zbMath1374.68237OpenAlexW1855543298MaRDI QIDQ4899259

No author found.

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A \(13k\)-kernel for planar feedback vertex set via region decomposition ⋮ Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics

This page was built for publication: An Improved Kernel for the Undirected Planar Feedback Vertex Set Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4899259&oldid=19284152"