scientific article; zbMATH DE number 1443271

zbMATH Open0945.05056MaRDI QIDQ4952178FDOQ4952178

Authors: Deming Li, Yanpei Liu 

Publication date: 9 May 2000

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 3848625
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• scientific article; zbMATH DE number 1979503
• Feedback vertex set on planar graphs

zbMATH Keywords

matchingindependent numberpolynomial algorithmfeedback vertex set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (15)

• A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
• On the Complexity of Singly Connected Vertex Deletion
• A feedback vertex set of 2-degenerate graphs
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• Feedback vertex sets in star graphs
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
• Some observations on holographic algorithms
• Decycling bipartite graphs
• The size of graphs with given feedback vertex number
• Acyclic polynomials of graphs
• Feedback vertex set on Hamiltonian graphs
• Dominating and large induced trees in regular graphs
• On the complexity of singly connected vertex deletion
• Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis

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 Q4952178)