Pages that link to "Item:Q2347002"

The following pages link to Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs (Q2347002):

Displaying 7 items.

• Eccentricity queries and beyond using hub labels (Q2166770) (← links)
• A note on the complexity of computing the number of reachable vertices in a digraph (Q2629773) (← links)
• A faster diameter problem algorithm for a chordal graph, with a connection to its center problem (Q2659238) (← links)
• Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
• Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
• (Q5091199) (← links)
• Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)