Pages that link to "Item:Q5951960"
From MaRDI portal
The following pages link to Diameter determination on restricted graph families (Q5951960):
Displaying 24 items.
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time (Q2011037) (← 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)
- Beyond Helly graphs: the diameter problem on absolute retracts (Q2672446) (← links)
- Distance problems within Helly graphs and \(k\)-Helly graphs (Q2682928) (← links)
- Computing Giant Graph Diameters (Q2819520) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- On the power of BFS to determine a graph's diameter (Q4446912) (← links)
- Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
- (Q5091199) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)
- A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
- Recognizing LBFS trees of bipartite graphs (Q6551704) (← links)
- \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
- Parameterized complexity of streaming diameter and connectivity problems (Q6614110) (← links)
- Corrigendum to: ``The diameter of AT-free graphs'' (Q6657590) (← links)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)
