Pages that link to "Item:Q1142786"

The following pages link to Computation of the center and diameter of outerplanar graphs (Q1142786):

Displaying 18 items.

• Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
• Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
• On powers and centers of chordal graphs (Q1055453) (← links)
• Computation of the center and diameter of outerplanar graphs (Q1142786) (← links)
• On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
• Finding a central vertex in an HHD-free graph (Q1408816) (← links)
• The degree-diameter problem for outerplanar graphs (Q2364099) (← 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)
• A simple linear-time algorithm for computing the center of an interval graph (Q3477967) (← links)
• Centers of maximal outerplanar graphs (Q4184872) (← links)
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)
• (Q4999722) (← links)
• Diameter, Eccentricities and Distance Oracle Computations on <i>H</i>-Minor Free Graphs and Graphs of Bounded (Distance) Vapnik–Chervonenkis Dimension (Q5048290) (← links)
• (Q5153834) (← links)
• A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
• Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)