Improved bounds for minimal feedback vertex sets in tournaments (Q4581278): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/jgt/MnichT18, #quickstatements; #temporary_batch_1731505720702
 
(5 intermediate revisions by 5 users not shown)
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.1002/jgt.22225 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2775048755 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q55008939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sophisticated voting outcomes and agenda control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the disparity and separation of tournament solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Feedback Vertex Sets in Tournaments / 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: Exact Algorithms via Monotone Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Minimal Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 7/3-Approximation for Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal transitive subtournaments / 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: Q4694754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Banks winners in tournaments are difficult to recognize / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems around exact algorithms / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/jgt/MnichT18 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:29, 13 November 2024

scientific article; zbMATH DE number 6919506
Language Label Description Also known as
English
Improved bounds for minimal feedback vertex sets in tournaments
scientific article; zbMATH DE number 6919506

    Statements

    Improved bounds for minimal feedback vertex sets in tournaments (English)
    0 references
    0 references
    0 references
    16 August 2018
    0 references
    combinatorial bounds
    0 references
    exponential-time algorithms
    0 references
    feedback vertex sets
    0 references
    tournaments
    0 references

    Identifiers