ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS (Q5249291): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128924609, #quickstatements; #temporary_batch_1723585310344
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Scheduling File Transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data transfers in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data transfers in networks with transceivers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly Logarithmic Communication Algorithms for Optical-Communication Parallel Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximations for multimessage multicasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple algorithms for multimessage multicasting with forwarding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Link scheduling in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling file transfers in fully connected networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical version of Lee's multicast switch architecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of File Transfer Scheduling with Forwarding / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128924609 / rank
 
Normal rank

Latest revision as of 23:07, 13 August 2024

scientific article; zbMATH DE number 6432515
Language Label Description Also known as
English
ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
scientific article; zbMATH DE number 6432515

    Statements

    Identifiers

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