Near-Linear Query Complexity for Graph Inference (Q3448836): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the bias of traceroute sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network tomography: recent developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance realization problems with applications to internet tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring networks with traceroute-like probes: Theory and simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Discovery and Verification with Distance Queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to reconstruct trees from additive distance data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Reconstruction via Distance Oracles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the longest path algorithm for reconstructing trees from distance matrices / rank
 
Normal rank

Latest revision as of 22:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Near-Linear Query Complexity for Graph Inference
scientific article

    Statements

    Identifiers

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