DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Feedback arc set
Feedback arc set
An Efficient Implementation of Sugiyama's Algorithm for Layered
Sorting Heuristics for the Feedback Arc Set Problem
An Exact Method for the Minimum Feedback Arc Set Problem
A Generalization of the Directed Graph Layering Problem
On the Unique Games Conjecture
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
Directed Feedback Vertex Set Problem Is FPT ⋆
16.11 Feedback Edge/Vertex Set 559
Arxiv:1702.07612V1 [Cs.DM] 24 Feb 2017 E-Mail:
[email protected]
Inapproximability of Feedback Vertex Set for Bounded Length Cycles
Sorting Noisy Data with Partial Information
Inapproximability of Maximum Acyclic Subgraph
An Exact Method for the Minimum Feedback
On the Complexity of Counting Feedback Arc Sets
Kemeny Consensus Complexity
Simple Proof of Hardness of Feedback Vertex Set
On Directed Feedback Vertex Set Parameterized by Treewidth∗
Hardness of Vertex Deletion and Project Scheduling!
Top View
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments✩
Graph and Election Problems Parameterized by Feedback Set Numbers
Feedback Arc Set in Tournaments (K-FAST) Problem
Feedback Vertex Set in Mixed Graphs Paul Bonsma1 Daniel Lokshtanov2
Combinatorial Algorithms for Feedback Problems in Directed Graphs∗
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
Feedback Arc Set in Bipartite Tournaments Is NP-Complete
Combinatorial Algorithms for Feedback Problems in Directed Graphs 1 Introduction
Visualisation of State Machines Using the Sugiyama Framework Master of Science Thesis in Computer Science
Efficient Computation of Feedback Arc Set at Web-Scale
The Parameterized Complexity of Packing Arc-Disjoint Cycles
How to Rank with Few Errors
FEEDBACK SET PROBLEMS in Recent
Hierarchical Drawing Algorithms
Computing Minimum Feedback Arc Set to Quantify the Transitivity in Sports Teams
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
On Enumerating All Minimal Solutions of Feedback Problems
On the Hardness and Inapproximability of Recognizing Wheeler Graphs