Pages that link to "Item:Q1736547"
From MaRDI portal
The following pages link to Computing the eccentricity distribution of large graphs (Q1736547):
Displayed 6 items.
- Multiaspect graphs: algebraic representation and algorithms (Q1662581) (← links)
- Editorial: Special issue on graph algorithms (Q1736576) (← links)
- Eccentricity queries and beyond using hub labels (Q2166770) (← links)
- Constructing uniform central graphs and embedding into them (Q2283212) (← 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)