A good algorithm for edge-disjoint branching (Q1214942): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(74)90024-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965700310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196458 / rank
 
Normal rank

Latest revision as of 15:14, 12 June 2024

scientific article
Language Label Description Also known as
English
A good algorithm for edge-disjoint branching
scientific article

    Statements

    A good algorithm for edge-disjoint branching (English)
    0 references
    1974
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers