Pages that link to "Item:Q3477967"

The following pages link to A simple linear-time algorithm for computing the center of an interval graph (Q3477967):

Displaying 28 items.

• The connected \(p\)-center problem on block graphs with forbidden vertices (Q418726) (← links)
• Backup 2-center on interval graphs (Q442280) (← links)
• Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs (Q543790) (← links)
• Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q832869) (← links)
• An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
• On minimum intersection of two minimum dominating sets of interval graphs (Q1377653) (← links)
• Finding a central vertex in an HHD-free graph (Q1408816) (← links)
• The connected \(p\)-center problem on cactus graphs (Q1630992) (← 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)
• The Connected p-Center Problem on Cactus Graphs (Q2958359) (← links)
• Efficient algorithms for centers and medians in interval and circular-arc graphs (Q4537621) (← links)
• Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← 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)
• Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time (Q5858646) (← links)
• Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles (Q5860479) (← links)
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5919104) (← links)
• Diameter determination on restricted graph families (Q5951960) (← links)
• Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees (Q5970916) (← links)
• The diameter of AT‐free graphs (Q6057658) (← links)
• Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
• A story of diameter, radius, and (almost) Helly property (Q6087123) (← links)
• Computation of diameter, radius and center of permutation graphs (Q6115743) (← links)
• \( \alpha_i\)-metric graphs: radius, diameter and all eccentricities (Q6582369) (← links)
• Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs (Q6671670) (← links)