Two hardness results on feedback vertex sets

Authors:
Wei Jiang;Tian Liu;Tienan Ren;Ke Xu
Affiliations:
Key Laboratory of High Confidence Software Technologies, Ministry of Education, Peking University, Beijing, China;Key Laboratory of High Confidence Software Technologies, Ministry of Education, Peking University, Beijing, China;Key Laboratory of High Confidence Software Technologies, Ministry of Education, Peking University, Beijing, China;National Lab of Software Development Environment, Beihang University, Beijing, China
Venue:
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Year:
2011

Citing 31
Cited 5

A graph theoretic approach to statistical data security

SIAM Journal on Computing
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition

Artificial Intelligence
On the independence number of random graphs

Discrete Mathematics
Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem

Artificial Intelligence
A linear-time algorithm for the weighted feedback vertex problem on interval graphs

Information Processing Letters
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference

SIAM Journal on Computing
Almost exact minimum feedback vertex set in meshes and butterflies

Information Processing Letters
Feedback vertex set in hypercubes

Information Processing Letters
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
New bounds on the size of the minimum feedback vertex set in meshes and butterflies

Information Processing Letters
A Min-Max Theorem on Feedback Vertex Sets

Mathematics of Operations Research
Minimum feedback vertex sets in shuffle-based interconnection networks

Information Processing Letters
Feedback vertex sets in star graphs

Information Processing Letters
Probability and Computing: Randomized Algorithms and Probabilistic Analysis

Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Many hard examples in exact phase transitions

Theoretical Computer Science
Operating Systems Concepts with Java

Operating Systems Concepts with Java
Random constraint satisfaction: Easy generation of hard (satisfiable) instances

Artificial Intelligence
Minimum weight feedback vertex sets in circle graphs

Information Processing Letters
On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

Algorithmica - Parameterized and Exact Algorithms
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems

Journal of Computer and System Sciences
An efficient algorithm for minimum feedback vertex sets in rotator graphs

Information Processing Letters
Exact phase transitions in random constraint satisfaction problems

Journal of Artificial Intelligence Research
Randomized algorithms for the loop cutset problem

Journal of Artificial Intelligence Research
Set intersection and consistency in constraint networks

Journal of Artificial Intelligence Research
Backdoors to typical case complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments

Theoretical Computer Science
Feedback vertex sets in rotator graphs

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
On feedback vertex set new measure and new structures

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Improved approximation algorithm for the feedback set problem in a bipartite tournament

Operations Research Letters

Tractable feedback vertex sets in restricted bipartite graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
A note on treewidth in random graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Independent domination on tree convex bipartite graphs

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A general model and thresholds for random constraint satisfaction problems

Artificial Intelligence
Feedback vertex sets on restricted bipartite graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A feedback vertex set is a subset of vertices whose deletion makes the remaining graph a forest. We show that the minimum FVS (MFVS) in star convex bipartite graphs is NP-hard to find, and give a tighter lower bound on the size of MFVS in sparse random graphs, to provide further evidence on the hardness of random CSPs.