On feedback problems in planar digraphs

DOI10.1007/3-540-53832-1_33MaRDI QIDQ4028105zbMATH OpenFDO

Authors Hermann Stamm

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-53832-1_33

zbMATH Keywords

approximation algorithmembeddingsplanar digraphsSteiner tree problem

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A fast and effective heuristic for the feedback arc set problem
• Approximating minimum feedback sets and multi-cuts in directed graphs (extended summary)
• scientific article; zbMATH DE number 219267
• Approximating minimum feedback sets and multicuts in directed graphs
• Exact localisations of feedback sets

Cited in

(12)

• Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs
• A Linear Kernel for Planar Feedback Vertex Set
• scientific article; zbMATH DE number 1526336 (Why is no real title available?)
• Circuit Mengerian directed graphs
• Primal-dual approximation algorithms for feedback problems in planar graphs
• A polyhedral approach to the feedback vertex set problem
• scientific article; zbMATH DE number 219267 (Why is no real title available?)
• Tight localizations of feedback sets
• Small feedback vertex sets in planar digraphs
• On the feedback vertex set problem for a planar graph
• A fast and effective heuristic for the feedback arc set problem
• PACE solver description: CRGone

This page was built for publication: On feedback problems in planar digraphs

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