On packing arborescences in temporal networks (Q477677): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W1985886670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and inference problems for temporal networks / 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: Independent branchings in acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-disjoint in-trees in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on disjoint arborescences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving and Increasing Local Edge-Connectivity in Mixed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Representatives of Subsets / rank
 
Normal rank

Latest revision as of 11:03, 9 July 2024

scientific article
Language Label Description Also known as
English
On packing arborescences in temporal networks
scientific article

    Statements

    On packing arborescences in temporal networks (English)
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithms
    0 references
    arborescence
    0 references
    temporal network
    0 references
    packing problem
    0 references
    0 references