scientific article; zbMATH DE number 1467487

zbMath0947.68138MaRDI QIDQ4488089

Ann Becker, Reuven Bar Yehuda, Dan Geiger

Publication date: 25 July 2000

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

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items

An improved deterministic parameterized algorithm for cactus vertex deletion, Circular convex bipartite graphs: feedback vertex sets, Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability, What’s Next? Future Directions in Parameterized Complexity, Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms, On the feedback number of 3-uniform linear extremal hypergraphs, Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization, Quick but odd growth of cacti, Feedback vertex sets on restricted bipartite graphs, A Linear Kernel for Planar Feedback Vertex Set, A faster parameterized algorithm for pseudoforest deletion, Fixed parameterized algorithms for generalized feedback vertex set problems, A naive algorithm for feedback vertex set, Partition-based logical reasoning for first-order and propositional theories, On feedback vertex set: new measure and new structures, Two Hardness Results on Feedback Vertex Sets, Subset Feedback Vertex Set Is Fixed-Parameter Tractable, Improved FPT Algorithms for Deletion to Forest-Like Structures., An improved FPT algorithm for almost forest deletion problem, Improved algorithms for feedback vertex set problems, A cubic kernel for feedback vertex set and loop cutset, Planar feedback vertex set and face cover: combinatorial bounds and subexponential algorithms, Slightly Superexponential Parameterized Problems, Faster deterministic \textsc{Feedback Vertex Set}, Improved analysis of highest-degree branching for feedback vertex set, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, Unnamed Item, Circular Convex Bipartite Graphs: Feedback Vertex Set, On group feedback vertex set parameterized by the size of the cutset