Pages that link to "Item:Q386904"
From MaRDI portal
The following pages link to On computing the diameter of real-world undirected graphs (Q386904):
Displaying 7 items.
- Into the square: on the complexity of some quadratic-time solvable problems (Q737085) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Computing the eccentricity distribution of large graphs (Q1736547) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002) (← links)
- A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
