Edge-disjoint Steiner trees and connectors in graphs (Q2701394): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-023-02621-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4321087641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-connectivity and edge-disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposing a hypergraph into \(k\) connected sub-hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity and edge-disjoint spanning trees / 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: Edge disjoint Steiner trees in graphs without large bridges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Steiner trees on four terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / 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: Steiner tree packing number and tree connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / 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: Packing the Steiner trees of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / 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 01:44, 1 August 2024

scientific article
Language Label Description Also known as
English
Edge-disjoint Steiner trees and connectors in graphs
scientific article

    Statements

    Edge-disjoint Steiner trees and connectors in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 April 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    edge-connectivity
    0 references
    packing Steiner trees
    0 references
    packing connectors
    0 references
    0 references