On the feedback vertex set problem for a planar graph

Computing (Vienna/New York)

Volumn 58, Issue 2, 1997, Pages 129-155

  Hackbusch, W ^a  

^a UNIVERSITY OF KIEL   (Germany)

Author keywords

Cycles; Feedback vertex set; Planar graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FEEDBACK; PROBLEM SOLVING; SET THEORY;

FEEDBACK VERTEX SETS; PLANAR DIGRAPHS;

GRAPH THEORY;

EID: 0030680375     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02684436     Document Type: Article

References (12)

1. Brandstädt, A.: The computational complexity of feedback vertex set, Hamiltonian circuit, dominating set, Steiner tree, and bandwidth on special perfect graphs. J. Inf. Process. Cybern. EIK 23, 471-477 (1987).
2. Brandstädt, A., Kratsch, D.: On domination problems for permutation and other graphs. Theor. Comp, Sci. 54, 181-198 (1987).
3. Hackbusch, W.: Multi-grid methods and applications. Berlin, Heidelberg, New York, Tokyo: Springer, 1985.
4. Hackbusch, W.: Elliptic differential equations. Berlin, Heidelberg, New York, Tokyo: Springer, 1992.
5. Hackbusch, W.: Iterative solution of large sparse systems of equations. Berlin, Heidelberg, New York, Tokyo: Springer 1994. Iterative Lösung großer schwachbesetzter Gleichungssysteme, 2. deutsche Auflage. Stuttgart: Teubner, 1993.
6. Hackbusch, W.: Iterative solution of large sparse systems of equations. Berlin, Heidelberg, New York, Tokyo: Springer 1994. Iterative Lösung großer schwachbesetzter Gleichungssysteme, 2. deutsche Auflage. Stuttgart: Teubner, 1993.
7. Monien, B., Schulz, R.: Four approximation algorithms for the feedback vertex set problem. Bericht Nr 9, Paderborn 1981 - Proc. of the 7th Conf. on Graph Theoretical Concepts of Comput. Sci., pp. 315-325. München: Hanser, 1981.
8. Reinelt, G.: The linear ordering problem: algorithms and applications. Research and Exposition in Mathematics 8. Berlin: Heldermann, 1985.
9. Speckenmeyer, E.: Bounds on feedback vertex sets of undirected cubic graphs. Coll. Math. Soc. Janos Bolyai 42, 719-729 (1983).
10. Stamm, H.: Graph-theoretical concepts in computer science. Lect. Notes Compt. Sci. 484, 79-89 (1992).
11. Wittum, G.: Filternde Zerlegungen: Schnelle Löser für große Gleichungssysteme (Filtering decomposition, fast solvers for large systems of equations). Teubner Skripten zur Numerik. Stuttgart: Teubner, 1992.
12. Hackbusch, W., Probst, Th.: Downwind Gauß-Seidel smoothing for convection dominated problems. Numer. Lin. Alg. Appl. (to appear).