Directed Steiner tree packing and directed tree connectivity (Q6093140): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey of Nordhaus-Gaddum type relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Terminology, Notation and Results / 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: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution to a conjecture on the generalized connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness and approximation results for packing Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree packing problem in VLSI design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pendant tree-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak Three-Linking in Eulerian Dgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint trees containing some given vertices in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate max-Steiner-tree-packing min-Steiner-cut theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized (edge-)connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong subgraph connectivity of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong subgraph <i>k</i>‐connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of Steiner trees and \(S\)-connectors in graphs / rank
 
Normal rank

Latest revision as of 02:06, 3 August 2024

scientific article; zbMATH DE number 7746557
Language Label Description Also known as
English
Directed Steiner tree packing and directed tree connectivity
scientific article; zbMATH DE number 7746557

    Statements

    Directed Steiner tree packing and directed tree connectivity (English)
    0 references
    5 October 2023
    0 references
    directed \(k\)-linkage
    0 references
    directed Steiner tree packing
    0 references
    directed tree connectivity
    0 references
    Eulerian digraph
    0 references
    out-tree
    0 references
    semicomplete digraph
    0 references
    symmetric digraph
    0 references

    Identifiers

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