Reconstruction of graphs based on random walks (Q837176): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59682403, #quickstatements; #temporary_batch_1712111774907
Created claim: DBLP publication ID (P1635): journals/tcs/WittmannSBT09, #quickstatements; #temporary_batch_1731468600454
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On optimal realizations of finite metric spaces by graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distance matrix of a graph and its tree realization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditionally positive functions and p-norm distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of the distance matrix of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363164 / 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: Matrix multiplication via arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for constructing trees from distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free trees and bidirectional trees as representations of psychological distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance matrix of a graph and its realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimality Criterion for Graph Embeddings of Metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm and its role in the study of optimal graph realizations of distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submatrices of non-tree-realizable distance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and the effective resistance of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive algorithm for realizing a distance matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/WittmannSBT09 / rank
 
Normal rank

Latest revision as of 04:42, 13 November 2024

scientific article
Language Label Description Also known as
English
Reconstruction of graphs based on random walks
scientific article

    Statements

    Reconstruction of graphs based on random walks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 September 2009
    0 references
    graph theory
    0 references
    distance realization problem
    0 references
    random walk
    0 references
    mean first hitting time
    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
    0 references