A linear-time algorithm for finding a minimum spanning pseudoforest (Q1098629): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3680833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and Analysis of Binomial Queue Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / 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: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithms for edge-coloring trees and unicyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forests, frames, and games: Algorithms for matroid sums and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algebraic Geometry of Motions of Bar-and-Body Frameworks / rank
 
Normal rank

Latest revision as of 16:07, 18 June 2024

scientific article
Language Label Description Also known as
English
A linear-time algorithm for finding a minimum spanning pseudoforest
scientific article

    Statements

    A linear-time algorithm for finding a minimum spanning pseudoforest (English)
    0 references
    0 references
    0 references
    1988
    0 references
    0 references
    pseudoforest
    0 references
    graph
    0 references
    minimum spanning tree
    0 references
    girth
    0 references
    0 references