A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4230366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distributed bit complexity of the ring: From the anonymous to the non-anonymous case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cube of every connected graph is 1-hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit complexity of breaking and achieving symmetry in chains and rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Minimum Cut Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with Hamiltonian square / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed all pairs shortest paths and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast routing table construction using small messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for weighted shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Network Diameter and Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of small cuts via cycle space sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Paths in the Square of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365130 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Weight Cycles and Triangles: Equivalences and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an Algorithm for Ordering of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trading Bit, Message, and Time Complexity of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest paths using bridging sets and rectangular matrix multiplication / rank
 
Normal rank

Revision as of 14:21, 11 July 2024

scientific article
Language Label Description Also known as
English
A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
scientific article

    Statements

    A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (English)
    0 references
    10 March 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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