On the feedback vertex set problem for a planar graph

DOI10.1007/BF02684436zbMath0870.05067OpenAlexW1557534265MaRDI QIDQ678111

Wolfgang Hackbusch

Publication date: 15 September 1997

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02684436

zbMATH Keywords

algorithmdecompositionplanar digraphsacyclic digraphfeedback vertex set problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

A Linear Kernel for Planar Feedback Vertex Set ⋮ A polyhedral approach to the feedback vertex set problem ⋮ Downwind Gauß‐Seidel‐Smoothing for Convection‐Dominated Problems

Uses Software

• LOLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On domination problems for permutation and other graphs
• Downwind Gauß‐Seidel‐Smoothing for Convection‐Dominated Problems

This page was built for publication: On the feedback vertex set problem for a planar graph