A new contraction technique with applications to congruency-constrained cuts (Q5918921): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114228501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for bimodular integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction for binary matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parsimonious property of cut covering problems and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the stable set problem in terms of the odd cycle packing number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On largest volume simplices and sub-determinants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric random edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmenting Graphs to Meet Edge-Connectivity Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient splitting off algorithms for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing submodular functions over families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minors of an incidence matrix and Smith normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to our paper ''The ellipsoid method and its consequences in combinatorial optimization'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Edge Splitting-Off Algorithms Maintaining All-Pairs Edge-Connectivities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some connectivity properties of Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular minimization under congruency constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Rounding for the Largest Simplex Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3330973 / rank
 
Normal rank

Latest revision as of 10:20, 23 July 2024

scientific article; zbMATH DE number 7241663
Language Label Description Also known as
English
A new contraction technique with applications to congruency-constrained cuts
scientific article; zbMATH DE number 7241663

    Statements

    A new contraction technique with applications to congruency-constrained cuts (English)
    0 references
    0 references
    0 references
    28 August 2020
    0 references
    minimum cuts
    0 references
    congruency-constrained optimization
    0 references
    contraction algorithm
    0 references
    splitting off
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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