Feedback Vertex Sets in Tournaments (Q4908824): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2886475100 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0905.0567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophisticated voting outcomes and agenda control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal stable sets in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating maximal independent sets with applications to graph colouring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of maximal bipartite subgraphs of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Maximal Independent Sets and Faster Exact Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative compression and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum feedback vertex set problem: Exact and enumeration algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth Computation and Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Induced Subgraphs via Minimal Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Sets and Bicliques in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Round Robin Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of the chromatic number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subtournaments of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal transitive subtournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of a theorem of Reid and Parker on tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms through enumerating maximal independent sets and other techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproof of a conjecture of Erdös and moser on tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating all minimal solutions of feedback problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems around exact algorithms / rank
 
Normal rank

Latest revision as of 05:51, 6 July 2024

scientific article; zbMATH DE number 6142485
Language Label Description Also known as
English
Feedback Vertex Sets in Tournaments
scientific article; zbMATH DE number 6142485

    Statements

    Feedback Vertex Sets in Tournaments (English)
    0 references
    0 references
    0 references
    7 March 2013
    0 references
    algorithms
    0 references
    data structures
    0 references
    tournaments
    0 references
    feedback vertex set
    0 references
    polynomial delay
    0 references
    combinatorial bounds
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references