On the feedback vertex set problem for a planar graph

DOI10.1007/BF02684436MaRDI QIDQ678111zbMATH OpenOpenAlexFDO

Authors 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

decompositionalgorithmacyclic digraphplanar digraphsfeedback vertex set problem

Mathematics Subject Classification ID

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

Recommendations

• Feedback vertex set on planar graphs
• Parallelism and the feedback vertex set problem
• Minimal feedback vertex sets in directed split‐stars
• scientific article; zbMATH DE number 139781

Cites work

• scientific article; zbMATH DE number 989459 (Why is no real title available?)
• scientific article; zbMATH DE number 3902051 (Why is no real title available?)
• scientific article; zbMATH DE number 3958638 (Why is no real title available?)
• scientific article; zbMATH DE number 4041287 (Why is no real title available?)
• scientific article; zbMATH DE number 52660 (Why is no real title available?)
• scientific article; zbMATH DE number 107890 (Why is no real title available?)
• scientific article; zbMATH DE number 139781 (Why is no real title available?)
• Downwind Gauß‐Seidel‐Smoothing for Convection‐Dominated Problems
• On domination problems for permutation and other graphs

Cited in

(11)

• Graph-Theoretic Concepts in Computer Science
• A polyhedral approach to the feedback vertex set problem
• On the feedback vertex set polytope of a series-parallel graph
• Downwind Gauß‐Seidel‐Smoothing for Convection‐Dominated Problems
• Feedback Vertex Sets on Tree Convex Bipartite Graphs
• Feedback vertex set on Hamiltonian graphs
• Two Hardness Results on Feedback Vertex Sets
• Small feedback vertex sets in planar digraphs
• scientific article; zbMATH DE number 4041287 (Why is no real title available?)
• Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms
• A Linear Kernel for Planar Feedback Vertex Set

Describes a project that uses

Uses Software

• LOLIB

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678111)