Invertibility of Digraphs and Tournaments (Q6141864): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genome Rearrangements and Sorting by Reversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inversions in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subsets with Intersections of Even Cardinality / 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: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum cardinality of a consistent set of arcs in a random tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean designs and self-dual matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transforming cabbage into turnip / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Arc Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure theorem for tournaments omitting <i>N</i><sub>5</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal Matrices Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament Ranking with Expected Profit in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Boolean dimension of a graph and other related parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal ranking of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimally ranking unrankable tournaments / rank
 
Normal rank

Revision as of 20:47, 23 August 2024

scientific article; zbMATH DE number 7793142
Language Label Description Also known as
English
Invertibility of Digraphs and Tournaments
scientific article; zbMATH DE number 7793142

    Statements

    Invertibility of Digraphs and Tournaments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    inversion number
    0 references
    digraphs
    0 references
    tournaments
    0 references
    decycling set
    0 references
    dijoin operation
    0 references