Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-015-0038-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1048071008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally semicomplete digraphs: A generalization of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-Disjoint Paths in Decomposable Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for feedback arc set in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament immersion and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully dynamic recognition algorithm and certificate for directed cographs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability results for feedback set problems in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jungles, bundles, and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4851597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325297 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of local tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization – Preprocessing with a Guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for feedback set problems and their duals in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments / rank
 
Normal rank

Latest revision as of 18:31, 12 July 2024

scientific article
Language Label Description Also known as
English
Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
scientific article

    Statements

    Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 October 2016
    0 references
    parameterized complexity
    0 references
    kernels
    0 references
    feedback vertex set
    0 references
    feedback arc set
    0 references
    decomposable digraph
    0 references
    bounded independence number
    0 references
    locally semicomplete digraph
    0 references
    quasi-transitive digraph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers