Feedback arc set in bipartite tournaments is NP-complete

Authors:
Jiong Guo;Falk Hüffner;Hannes Moser
Affiliations:
Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany;Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743 Jena, Germany
Venue:
Information Processing Letters
Year:
2007

Citing 10
Cited 13

Feedback vertex sets and cyclically reducible graphs

Journal of the ACM (JACM)
A polynomial algorithm for the 2-path problem for semicomplete digraphs

SIAM Journal on Discrete Mathematics
On Feedback Problems in Diagraphs

WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
A Min-Max Theorem on Feedback Vertex Sets

Mathematics of Operations Research
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Ranking Tournaments

SIAM Journal on Discrete Mathematics
The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

Combinatorics, Probability and Computing
Computing slater rankings using similarities among candidates

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Fixed-parameter tractability results for feedback set problems in tournaments

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Some Parameterized Problems On Digraphs

The Computer Journal

Feedback arc set problem in bipartite tournaments

Information Processing Letters
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Feedback arc set problem in bipartite tournaments

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Solving subgraph isomorphism problems with constraint programming

Constraints
Identifying and eliminating inconsistencies in mappings across hierarchical ontologies

OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments

Theoretical Computer Science
A polynomial kernel for feedback arc set on bipartite tournaments

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Fixed-parameter complexity of feedback vertex set in bipartite tournaments

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Uniqueness in Discrete Tomography: Three Remarks and a Corollary

SIAM Journal on Discrete Mathematics
A quadratic vertex kernel for feedback arc set in bipartite tournaments

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The Left and Right Context of a Word: Overlapping Chinese Syllable Word Segmentation with Minimal Context

ACM Transactions on Asian Language Information Processing (TALIP)
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

Theory of Computing Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

The Feedback Arc Set problem asks whether it is possible to delete at most k arcs to make a directed graph acyclic. We show that Feedback Arc Set is NP-complete for bipartite tournaments, that is, directed graphs that are orientations of complete bipartite graphs.