Optimum matching forests I: Special weights (Q3922478): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5668821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: Optimum branchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4078069 / 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: Optimum matching forests II: General weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4080661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimum branchings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:47, 13 June 2024

scientific article
Language Label Description Also known as
English
Optimum matching forests I: Special weights
scientific article

    Statements

    Optimum matching forests I: Special weights (English)
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    matching forests
    0 references
    branchings
    0 references
    directed graph
    0 references
    matchings
    0 references
    undirected graph
    0 references
    efficient algorithm
    0 references
    combinatorial optimization
    0 references