NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (Q894461): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q62039068, #quickstatements; #temporary_batch_1707232231678
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 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.1016/j.ipl.2015.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152019671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How hard is it to control an election? / rank
 
Normal rank
Property / cites work
 
Property / cites work: General factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Swap Bribery / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control and Bribery in Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Hard Is Bribery in Elections? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multigraph realizations of degree sequences: Maximization is easy, minimization is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank

Latest revision as of 04:07, 11 July 2024

scientific article
Language Label Description Also known as
English
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
scientific article

    Statements

    NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting (English)
    0 references
    0 references
    0 references
    1 December 2015
    0 references
    computational complexity
    0 references
    computational social choice
    0 references
    graph problems
    0 references
    manipulating elections
    0 references
    approval voting
    0 references

    Identifiers

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