On the public citation graph

An optimal algorithm to solve the all‐pair shortest path problem on interval graphs

0 signed · 37 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0020-0190(85)90050-xopenalex-snapshot
Finding Hamiltonian circuits in interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(88)90091-9openalex-snapshot
A unified approach to domination problems on interval graphs
inferredcites →https://doi.org/10.1016/0020-0190(89)90184-1openalex-snapshot
Linear algorithm for domatic number problem on interval graphs
inferredcites →https://doi.org/10.1016/0166-218x(88)90086-8openalex-snapshot
The complexity of generalized clique covering
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/0890-5401(91)90045-4openalex-snapshot
On finding the minimum bandwidth of interval graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1109/sfcs.1985.6openalex-snapshot
An all pairs shortest path algorithm with expected running time O(n 2logn)

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.10023openalex-snapshot
Efficient algorithms for centers and medians in interval and circular‐arc graphs
inferred← citeshttps://doi.org/10.1007/3-540-45253-2_10openalex-snapshot
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs
inferred← citeshttps://doi.org/10.1007/3-540-45477-2_11openalex-snapshot
Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach
inferred← citeshttps://doi.org/10.1007/3-540-57273-2_40openalex-snapshot
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
inferred← citeshttps://doi.org/10.1007/978-3-030-67899-9_6openalex-snapshot
Burning Grids and Intervals
inferred← citeshttps://doi.org/10.1007/978-3-319-15612-5_9openalex-snapshot
Approximate Distance Oracle in O(n2) Time and O(n) Space for Chordal Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_23openalex-snapshot
Algorithms for Interval Structures with Applications
inferred← citeshttps://doi.org/10.1007/bf01192049openalex-snapshot
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
inferred← citeshttps://doi.org/10.1007/bf02936037openalex-snapshot
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90174-8openalex-snapshot
Computing the average distance of an interval graph
inferred← citeshttps://doi.org/10.1016/j.dam.2006.06.008openalex-snapshot
O(1) query time algorithm for all pairs shortest distances on permutation graphs
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.09.002openalex-snapshot
Estimating all pairs shortest paths in restricted graph families: a unified approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.075openalex-snapshot
Algorithms for interval structures with applications
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00195-1openalex-snapshot
Solving the all-pairs-shortest-length problem on chordal bipartite graphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00103-5openalex-snapshot
Unified all-pairs shortest path algorithms in the chordal hierarchy
inferred← citeshttps://doi.org/10.1023/a:1023695531209openalex-snapshot
An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs
inferred← citeshttps://doi.org/10.1080/00207169508804449openalex-snapshot
Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
inferred← citeshttps://doi.org/10.1109/icci.1993.315407openalex-snapshot
Efficient algorithms for all-pairs shortest path problem on interval, directed path, and circular-arc graphs
inferred← citeshttps://doi.org/10.1109/icpads.1994.589892openalex-snapshot
Semigroup computation and its applications on mesh-connected computers with hyperbus broadcasting
inferred← citeshttps://doi.org/10.1109/ipps.1993.262881openalex-snapshot
On the shortest path problem for permutation graphs
inferred← citeshttps://doi.org/10.1109/ipps.1994.288297openalex-snapshot
Solving the all-pair shortest path problem on interval and circular-arc graphs
inferred← citeshttps://doi.org/10.1109/ispan.1994.367160openalex-snapshot
Parallel maximal cliques algorithms for interval graphs with applications
inferred← citeshttps://doi.org/10.1142/s0129054199000320openalex-snapshot
O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS
inferred← citeshttps://doi.org/10.1142/s1465876302000575openalex-snapshot
AN OPTIMAL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS ON TRAPEZOID GRAPHS
inferred← citeshttps://doi.org/10.1515/ausi-2016-0002openalex-snapshot
A survey of the all-pairs shortest paths problem and its variants in graphs
inferred← citeshttps://doi.org/10.33436/v32i4y202203openalex-snapshot
Puterea modelelor de interval în problema calculării indicilor de centralitate
inferred← citeshttps://doi.org/10.48550/arxiv.2010.01439openalex-snapshot
Burning Geometric Graphs
inferred← citeshttps://doi.org/10.5555/1115481.1712333openalex-snapshot
Estimating all pairs shortest paths in restricted graph families
inferred← citeshttps://doi.org/10.5555/365411.365449openalex-snapshot
Fast approximation of centrality
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.