Edge-colored graphs with applications to homogeneous faults (Q1944099): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Colorful isomorphic spanning trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized cover-free families. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure communication in multicast channels: The answer to Franklin and Wright's question / rank
 
Normal rank

Latest revision as of 08:39, 6 July 2024

scientific article
Language Label Description Also known as
English
Edge-colored graphs with applications to homogeneous faults
scientific article

    Statements

    Edge-colored graphs with applications to homogeneous faults (English)
    0 references
    4 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graphs
    0 references
    network security
    0 references
    network reliability
    0 references
    homogeneous faults
    0 references
    fault tolerance
    0 references
    0 references
    0 references
    0 references
    0 references