Fixed-Parameter Algorithms for Kemeny Scores (Q3511416): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57359881, #quickstatements; #temporary_batch_1710976035288
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved fixed parameter tractable algorithms for two ``edge'' problems: MAXCUT and MAXDAG / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems / rank
 
Normal rank

Latest revision as of 13:19, 28 June 2024

scientific article
Language Label Description Also known as
English
Fixed-Parameter Algorithms for Kemeny Scores
scientific article

    Statements