P. Festa, P.M. Pardalos & M.G.C. Resende (1999), Feedback Set Problems, in 'Handbook of Combinatorial Optimization', D.Z. Du & P.M. Pardalos, Eds. Vol. 4, Kluwer Academic Publishers, Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Global Constraint for Cutset Problems - Fages, Lal (2003) (Correct)
....that the subgraph of G restricted to the vertices belonging to V n V is acyclic. Deciding whether an arbitrary graph admits a cutset of a given cardinality is an NP complete problem [6] The minimum cutset problem, i.e. nding a cutset of minimum cardinality (also called a feedback vertex set [4]) is thus an NP hard problem. This problem has found applications in various areas, such as deadlock breaking [2] program veri cation [11] or Bayesian inference [15] There are a few classes of graphs for which the minimum cutset problem has a polynomial time complexity. These classes are de ....
P. Festa, P.M. Pardalos, and M.G.C. Resende. Feedback set problems. In In Handbook of Combinatorial Optimization, volume 4. Kluwer Academic Publishers, 1999.
A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005) (Correct)
No context found.
P. Festa, P.M. Pardalos & M.G.C. Resende (1999), Feedback Set Problems, in 'Handbook of Combinatorial Optimization', D.Z. Du & P.M. Pardalos, Eds. Vol. 4, Kluwer Academic Publishers,
A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005) (Correct)
No context found.
P. Festa, P.M. Pardalos & M.G.C. Resende (1999), Feedback Set Problems, in 'Handbook of Combinatorial Optimization', D.Z. Du & P.M. Pardalos, Eds. Vol. 4, Kluwer Academic Publishers,
A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005) (Correct)
No context found.
P. Festa, P.M. Pardalos & M.G.C. Resende (1999), Feedback Set Problems, in 'Handbook of Combinatorial Optimization', D.Z. Du & P.M. Pardalos, Eds. Vol. 4, Kluwer Academic Publishers,
A Contraction Algorithm for finding Minimal Feedback Sets - Koehler (2005) (Correct)
No context found.
P. Festa, P.M. Pardalos & M.G.C. Resende (1999), Feedback Set Problems, in 'Handbook of Combinatorial Optimization', D.Z. Du & P.M. Pardalos, Eds. Vol. 4, Kluwer Academic Publishers,
A Constraint Programming Approach to Cutset Problems - Fages, Lal (Correct)
No context found.
P. Festa, P.M. Pardalos, and M.G.C. Resende. Feedback set problems. In In Handbook of Combinatorial Optimization, volume 4. Kluwer Academic Publishers, 1999.
Edge{Disjoint Odd Cycles in Planar Graphs - Daniel Kr Al' (2002) (Correct)
No context found.
P. Festa, P. M. Pardalos and M. G. C. Resende, Feedback set problems, in "D. Z. Du and P. M. Pardalos (eds.), Handbook of Combinatorial Optimization", Vol. 4, 209-258, Kluwer Academic Publishers, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC