Greedoids from flames (Q6056772): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/jgt.22681 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Connectivity in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Menger's theorem for infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enlarging vertex-flames in countable digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence Spaces and Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the linkage theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost flow with set-constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polymatroidal flows with lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4261777 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/JGT.22681 / rank
 
Normal rank

Latest revision as of 19:02, 30 December 2024

scientific article; zbMATH DE number 7745232
Language Label Description Also known as
English
Greedoids from flames
scientific article; zbMATH DE number 7745232

    Statements

    Greedoids from flames (English)
    0 references
    0 references
    4 October 2023
    0 references
    edge-connectivity
    0 references
    greedoid
    0 references
    rooted digraph
    0 references
    strongly polynomial algorithm
    0 references

    Identifiers

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