Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths (Q5858647): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On Finding Lowest Common Ancestors in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scaling Algorithms for Weighted Matching in General Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatoric interpretation of dual variables for weighted matching and \(f\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for Weighted Matching and Extensions to <i>b</i> -matching and <i>f</i> -factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of tensors and fast matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected distances and the postman-structure of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potentials in Undirected Graphs and Planar Multiflows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining bridge-connected and biconnected components on-line / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/16m1106225 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3151200418 / rank
 
Normal rank

Latest revision as of 10:44, 30 July 2024

scientific article; zbMATH DE number 7333146
Language Label Description Also known as
English
Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths
scientific article; zbMATH DE number 7333146

    Statements

    Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths (English)
    0 references
    0 references
    0 references
    14 April 2021
    0 references
    algebraic algorithms
    0 references
    matchings
    0 references
    factors
    0 references
    shortest paths
    0 references

    Identifiers

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