scientific article; zbMATH DE number 1443271

zbMath0945.05056MaRDI QIDQ4952178

Yanpei Liu, Deming Li

Publication date: 9 May 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matchingpolynomial algorithmfeedback vertex setindependent number

Mathematics Subject Classification ID

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

Related Items (11)

Some observations on holographic algorithms ⋮ The size of graphs with given feedback vertex number ⋮ On the Complexity of Singly Connected Vertex Deletion ⋮ Decycling bipartite graphs ⋮ Feedback vertex set on Hamiltonian graphs ⋮ Dominating and large induced trees in regular graphs ⋮ Acyclic polynomials of graphs ⋮ A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion ⋮ On the complexity of singly connected vertex deletion

This page was built for publication: