Network-Based Vertex Dissolution (Q5254088): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / 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: Generalized planar matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star Partitions of Perfect Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control and Bribery in Voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Restricted Two-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fair division solution to the problem of redistricting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spanning tree heuristic for regional clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Based Heuristic for Political Districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path partition problem and related problems in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on Multivariate Algorithmics and Problem Parameterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational approach to unbiased districting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal redistricting under geographical constraints: why ``pack and crack'' does not work / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial and computational aspects of graph packing and graph decomposition / rank
 
Normal rank

Latest revision as of 04:19, 10 July 2024

scientific article; zbMATH DE number 6443688
Language Label Description Also known as
English
Network-Based Vertex Dissolution
scientific article; zbMATH DE number 6443688

    Statements

    Network-Based Vertex Dissolution (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 June 2015
    0 references
    computational complexity analysis
    0 references
    combinatorial algorithms
    0 references
    economization
    0 references
    election control
    0 references
    flow networks
    0 references
    matching
    0 references
    NP-hard problems
    0 references
    political districting
    0 references
    redistribution scenarios
    0 references

    Identifiers

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