scientific article
From MaRDI portal
Publication:3128894
zbMath0867.05073MaRDI QIDQ3128894
Joseph (Seffi) Naor, Ron M. Roth, Reuven Bar Yehuda, Dan Geiger
Publication date: 1 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bayesian inferenceconstraint satisfaction problemspolynomial-time algorithmsperformance ratiovertex weightsvertex feedback setblackout vertices
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (16)
On approximation properties of the Independent set problem for degree 3 graphs ⋮ Primal-dual approximation algorithms for feedback problems in planar graphs ⋮ Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem ⋮ A primal-dual approach to approximation of node-deletion problems for matroidal properties ⋮ Local conditioning in Bayesian networks ⋮ A Linear Kernel for Planar Feedback Vertex Set ⋮ Solving the feedback vertex set problem on undirected graphs ⋮ A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach ⋮ A constraint programming approach to cutset problems ⋮ Dynamic parameterized problems ⋮ Dynamic monopolies and feedback vertex sets in cycle permutation graphs, generalized Petersen graphs and torus cordalis ⋮ A unified approximation algorithm for node-deletion problems ⋮ A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs ⋮ The integrity of a cubic graph ⋮ Approximating minimum feedback vertex sets in hypergraphs ⋮ A justification of local conditioning in Bayesian networks
This page was built for publication:
