The dynamic predicate stashing copy problem and the Steiner problem in graphs (Q1582038): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the steiner problem in grapsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: An edge elimination test for the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4395322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner's problem in graphs and its implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamic predicate stashing copy problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Managing Redundancy in Distributed Computer Networks: A State Transition Graph Approach for the Stashing Problem / rank
 
Normal rank

Latest revision as of 16:19, 30 May 2024

scientific article
Language Label Description Also known as
English
The dynamic predicate stashing copy problem and the Steiner problem in graphs
scientific article

    Statements

    The dynamic predicate stashing copy problem and the Steiner problem in graphs (English)
    0 references
    0 references
    0 references
    0 references
    3 September 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    network programming
    0 references
    communication
    0 references
    Steiner problem in graphs
    0 references