Constructing edge-disjoint Steiner paths in lexicographic product networks (Q1738072): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.amc.2017.03.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2599340893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reliable broadcasting in product networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2911581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lexicographic Products and the Power of Non-linear Network Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Line Connectivity and Optimally Invulnerable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Grid Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3987052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying codes of lexicographic product of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees on the star network with applications to fault tolerance / 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: Packing Steiner trees: A cutting plane algorithm and computational results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3953800 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of graphs into three components by the removal of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pendant tree-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-connectivity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of gossiping and broadcasting in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Paths in Grid Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4848216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum broadcasting and personalized communication in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal graphs with internally disjoint Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized 3-connectivity of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized 3-connectivity of star graphs and bubble-sort graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Connectivity of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized 3-connectivity of Lexicographic product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with large generalized (edge-)connectivity / 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: Path-connectivity of lexicographic product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(\ell\)-connectivity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3803148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3012590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of path properties for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2931463 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:48, 19 July 2024

scientific article
Language Label Description Also known as
English
Constructing edge-disjoint Steiner paths in lexicographic product networks
scientific article

    Statements

    Constructing edge-disjoint Steiner paths in lexicographic product networks (English)
    0 references
    0 references
    29 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    edge-connectivity
    0 references
    Steiner tree
    0 references
    edge-disjoint Steiner paths
    0 references
    packing
    0 references
    path edge-connectivity
    0 references
    lexicographic product
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references