Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3128902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line competitive algorithms for call admission in optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-to-all communication for some wavelength-routed all-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software Libraries for Linear Algebra Computations on High Performance Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient wavelength routing on directed fiber trees / 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: Q4870160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant broadcasting and gossiping in communication networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient routing in all-optical networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal theory. An account of some aspects of combinatorial mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Communication Complexity of Atomic Commitment and of Gossiping / rank
 
Normal rank

Latest revision as of 01:30, 16 July 2024

scientific article; zbMATH DE number 6898404
Language Label Description Also known as
English
Colouring paths in directed symmetric trees with applications to WDM routing
scientific article; zbMATH DE number 6898404

    Statements

    Identifiers

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