scientific article; zbMATH DE number 4041287

MaRDI QIDQ3779759zbMATH OpenFDO

Authors Andreas Brandtstädt

Publication date 1987

zbMATH Keywords

chordal graphscomputational complexityNP-completeperfect graphspermutation graphs

Mathematics Subject Classification ID

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

Recommendations

• On the feedback vertex set problem in permutation graphs
• On the feedback vertex set problem for a planar graph
• Feedback vertex set on Hamiltonian graphs
• Complexity of counting feedback vertex sets
• Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
• A unified polynomial-time algorithm for feedback vertex set on graphs of bounded mim-width
• On the minimum feedback vertex set problem: Exact and enumeration algorithms
• Two Hardness Results on Feedback Vertex Sets

Cited in

(8)

• Problems with generalized Steiner problems
• Tree-decompositions with bags of small diameter
• Catching a fast robber on interval graphs
• scientific article; zbMATH DE number 3900817 (Why is no real title available?)
• scientific article; zbMATH DE number 3919840 (Why is no real title available?)
• scientific article; zbMATH DE number 48751 (Why is no real title available?)
• Minimum dominating sets of intervals on lines
• On the feedback vertex set problem for a planar graph

This page was built for publication:

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