On the public citation graph
A linear-time algorithm for finding a central vertex of a chordal graph
0 signed · 54 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0166-218x(80)90039-6openalex-snapshot
Computation of the center and diameter of outerplanar graphs
inferredcites →https://doi.org/10.1016/0166-218x(83)90068-9openalex-snapshot
On powers and centers of chordal graphs
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72924-4openalex-snapshot
Classical Perfect Graphs
inferredcites →https://doi.org/10.1080/00207169008803870openalex-snapshot
A simple linear-time algorithm for computing the center of an interval graph
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1137/0605034openalex-snapshot
The k -Domination and k -Stability Problems on Sun-Free Chordal Graphs
inferredcites →https://doi.org/10.1287/trsc.15.2.98openalex-snapshot
Linear Algorithms for Finding the Jordan Center and Path Center of a Tree
inferredcites →https://doi.org/10.1287/trsc.7.3.287openalex-snapshot
Minimax Location of a Facility in an Undirected Tree Graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.21998openalex-snapshot
A story of diameter, radius, and (almost) Helly property
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_15openalex-snapshot
Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems
inferred← citeshttps://doi.org/10.1007/3-540-45995-2_22openalex-snapshot
On the Power of BFS to Determine a Graphs Diameter
inferred← citeshttps://doi.org/10.1007/3-540-46784-x_35openalex-snapshot
On Claw-Free Asteroidal Triple-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-04651-4_1openalex-snapshot
Fast Approximation of Centrality and Distances in Hyperbolic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_22openalex-snapshot
Fast Deterministic Algorithms for Computing All Eccentricities in (Hyperbolic) Helly Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-86838-3_25openalex-snapshot
Beyond Helly Graphs: The Diameter Problem on Absolute Retracts
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_20openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_33openalex-snapshot
Graph Search Trees and Their Leaves
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_70openalex-snapshot
Approximating the Diameter of Planar Graphs in Near Linear Time
inferred← citeshttps://doi.org/10.1007/s00453-024-01223-6openalex-snapshot
$$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities
inferred← citeshttps://doi.org/10.1007/s00453-025-01344-6openalex-snapshot
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112326openalex-snapshot
A faster diameter problem algorithm for a chordal graph, with a connection to its center problem
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.03.005openalex-snapshot
Into the Square: On the Complexity of Some Quadratic-time Solvable Problems
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105873openalex-snapshot
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.03.022openalex-snapshot
Helly-gap of a graph and vertex eccentricities
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113690openalex-snapshot
Distance problems within Helly graphs and k-Helly graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00208-6openalex-snapshot
On claw-free asteroidal triple-free graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00419-5openalex-snapshot
Finding a central vertex in an HHD-free graph
inferred← citeshttps://doi.org/10.1016/s0304-3975(03)00424-9openalex-snapshot
Tree spanners on chordal graphs: complexity and algorithms
inferred← citeshttps://doi.org/10.1111/itor.12236openalex-snapshot
Linear‐time graph distance and diameter approximation
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch28openalex-snapshot
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611975031.33openalex-snapshot
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic Õ ( n 5/3 ) Time
inferred← citeshttps://doi.org/10.1137/18m1193402openalex-snapshot
Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time
inferred← citeshttps://doi.org/10.1137/s0895480195321718openalex-snapshot
Convexity and HHD-Free Graphs
inferred← citeshttps://doi.org/10.1142/s1793830922500392openalex-snapshot
Computation of diameter, radius and center of permutation graphs
inferred← citeshttps://doi.org/10.1145/1377676.1377687openalex-snapshot
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
inferred← citeshttps://doi.org/10.1145/1412228.1455266openalex-snapshot
Fast computation of empirically tight bounds for the diameter of massive graphs
inferred← citeshttps://doi.org/10.1145/2488608.2488673openalex-snapshot
Fast approximation algorithms for the diameter and radius of sparse graphs
inferred← citeshttps://doi.org/10.1145/2764910openalex-snapshot
Approximating the Diameter of Planar Graphs in Near Linear Time
inferred← citeshttps://doi.org/10.26493/1855-3974.3238.2a8openalex-snapshot
On the leaves of graph search trees
inferred← citeshttps://doi.org/10.3390/math13050885openalex-snapshot
Center of Trapezoid Graph: Application in Selecting Center Location to Set up a Private Hospital
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2013.153openalex-snapshot
Inapproximability of Rainbow Colouring
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.46openalex-snapshot
Approximation Algorithms for Min-Distance Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1312.3182openalex-snapshot
On The Center Sets and Center Numbers of Some Graph Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1407.4972openalex-snapshot
Into the Square - On the Complexity of Quadratic-Time Solvable Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1803.04660openalex-snapshot
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1910.10412openalex-snapshot
A story of diameter, radius and Helly property
inferred← citeshttps://doi.org/10.48550/arxiv.2106.02120openalex-snapshot
Approximation Algorithms for Min-Distance Problems in DAGs
inferred← citeshttps://doi.org/10.5555/2884435.2884463openalex-snapshot
Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
inferred← citeshttps://doi.org/10.7155/jgaa.00496openalex-snapshot
Fast approximation of eccentricities and distances in hyperbolic graphs
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.