An efficient scaling algorithm for the minimum weight bibranching problem (Q652532): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to make a digraph strongly connected / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / 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: An efficient algorithm for minimum-weight bibranching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max Relations for Directed Graphs / 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: A data structure for dynamic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank

Latest revision as of 18:33, 4 July 2024

scientific article
Language Label Description Also known as
English
An efficient scaling algorithm for the minimum weight bibranching problem
scientific article

    Statements

    An efficient scaling algorithm for the minimum weight bibranching problem (English)
    0 references
    0 references
    0 references
    14 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    branching
    0 references
    bipartite edge cover
    0 references
    weight scaling
    0 references
    primal-dual algorithm
    0 references
    blocking augmentation
    0 references
    0 references