Discovery of network properties with all-shortest-paths queries (Q962167): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5315023 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Emergence of Scaling in Random Networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On recognizing graph properties from adjacency matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4788610 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4464781 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4796165 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank | |||
Normal rank |
Latest revision as of 16:23, 2 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Discovery of network properties with all-shortest-paths queries |
scientific article |
Statements
Discovery of network properties with all-shortest-paths queries (English)
0 references
6 April 2010
0 references
graph property
0 references
network
0 references
discovery
0 references
query
0 references
online algorithm
0 references
shortest path
0 references