Non-preemptive tree packing (Q5925632): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Time-Expanded Packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3888545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal attack and reinforcement of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic orderings and cyclic arboricity of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordinated consensus in dynamic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree packing number of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank

Latest revision as of 16:41, 31 July 2024

scientific article; zbMATH DE number 7661313
Language Label Description Also known as
English
Non-preemptive tree packing
scientific article; zbMATH DE number 7661313

    Statements

    Non-preemptive tree packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning tree packing
    0 references
    non-preemptive scheduling
    0 references
    combinatorial optimization
    0 references
    time-varying graphs
    0 references
    keeping a network connected over time
    0 references
    0 references