On the public citation graph
On finding optimal and near-optimal lineal spanning trees
0 signed · 25 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.1007/bf02579320openalex-snapshot
A parallel algorithm for the maximal path problem
inferredcites →https://doi.org/10.1016/0004-3702(80)90051-xopenalex-snapshot
Increasing tree search efficiency for constraint satisfaction problems
inferredcites →https://doi.org/10.1016/0196-6774(86)90040-4openalex-snapshot
An efficient parallel algorithm for shifting the root of a depth first spanning tree
inferredcites →https://doi.org/10.1080/03081088308817513openalex-snapshot
Finding triconnected components of graphs
inferredcites →https://doi.org/10.1109/proc.1982.12399openalex-snapshot
Graphs, networks, and algorithms
inferredcites →https://doi.org/10.1137/0215058openalex-snapshot
Parallel Algorithms for Depth-First Searches I. Planar Graphs
inferredcites →https://doi.org/10.1145/22145.22149openalex-snapshot
A parallel algorithm for the maximal path problem
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.3190190408openalex-snapshot
On the existence of special depth first search trees
inferred← citeshttps://doi.org/10.1006/jagm.1993.1001openalex-snapshot
On Linear Time Minor Tests with Depth-First Search
inferred← citeshttps://doi.org/10.1007/3-540-51542-9_48openalex-snapshot
On linear time minor tests and depth first search
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_97openalex-snapshot
On the approximability of some maximum spanning tree problems
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_25openalex-snapshot
On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves
inferred← citeshttps://doi.org/10.1007/978-3-031-43587-4_28openalex-snapshot
Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves
inferred← citeshttps://doi.org/10.1007/978-3-032-11835-6_21openalex-snapshot
A Parameterized Complexity Analysis of Bounded Height Depth-First Search Trees
inferred← citeshttps://doi.org/10.1007/bfb0028275openalex-snapshot
Facility dispersion problems: Heuristics and special cases
inferred← citeshttps://doi.org/10.1016/0012-365x(93)90375-4openalex-snapshot
Recognition of DFS trees: sequential and parallel algorithms with refined verifications
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90111-oopenalex-snapshot
Resource allocation under limited sharing
inferred← citeshttps://doi.org/10.1016/j.dam.2018.08.011openalex-snapshot
Complexity of independency and cliquy trees
inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103680openalex-snapshot
On the parameterized complexity of lineal topologies (depth-first spanning trees) with many or few leaves
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00265-4openalex-snapshot
On the approximability of some maximum spanning tree problems
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.