On the public citation graph
Recursive Graphs, Recursive Labelings and Shortest Paths
0 signed · 34 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/bf00995176openalex-snapshot
Minimum dominating cycles in 2-trees
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1016/0022-0000(79)90053-9openalex-snapshot
Linear algorithms on recursive representations of trees
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/1003021openalex-snapshot
The Use of Linear Graphs in Gauss Elimination
inferredcites →https://doi.org/10.1145/321992.321993openalex-snapshot
Efficient Algorithms for Shortest Paths in Sparse Networks
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_100openalex-snapshot
Canonical representations of partial 2-and 3-trees
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_19openalex-snapshot
Limiting Distribution for Distances in k-Trees
inferred← citeshttps://doi.org/10.1007/bf00117743openalex-snapshot
Knowledge representation for mathematical discovery: Three experiments in graph theory
inferred← citeshttps://doi.org/10.1007/bf01994877openalex-snapshot
Canonical representations of partial 2- and 3-trees
inferred← citeshttps://doi.org/10.1007/s00373-009-0851-yopenalex-snapshot
On the Structure of Contractible Edges in k-connected Partial k-trees
inferred← citeshttps://doi.org/10.1007/s11071-020-06011-9openalex-snapshot
Leader-follower coherence in noisy ring-trees networks
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90164-xopenalex-snapshot
Separating subgraphs in k-trees: Cables and caterpillars
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90226-eopenalex-snapshot
Efficient sets in partial k-trees
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90019-1openalex-snapshot
The monadic second order logic of graphs VI: on several representations of graphs by relational structures
inferred← citeshttps://doi.org/10.1016/0196-6774(90)90006-zopenalex-snapshot
Parallel algorithms for cographs and parity graphs with applications
inferred← citeshttps://doi.org/10.1016/j.dam.2005.05.021openalex-snapshot
Subclasses of k-trees: Characterization and recognition
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.1016/s1571-0653(04)00408-1openalex-snapshot
A Cryptographic Code Based on Digraphs
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80039-3openalex-snapshot
Equilateral Drawing of 2-Connected Planar Chordal Graphs
inferred← citeshttps://doi.org/10.1088/1751-8113/41/3/035004openalex-snapshot
Vertex labeling and routing in expanded Apollonian networks
inferred← citeshttps://doi.org/10.1109/12.5979openalex-snapshot
NC algorithms for recognizing chordal graphs and k trees
inferred← citeshttps://doi.org/10.1109/hicss.1994.323265openalex-snapshot
Parallel algorithms for k-tree recognition and its applications
inferred← citeshttps://doi.org/10.1109/ipps.1992.223066openalex-snapshot
Efficient parallel shortest path algorithms for k-chordal graphs
inferred← citeshttps://doi.org/10.1109/lics.1990.113745openalex-snapshot
On the expression of monadic second-order graph properties without quantifications over sets of edges
inferred← citeshttps://doi.org/10.20429/tag.2024.000105openalex-snapshot
A Survey of Maximal k-Degenerate Graphs and k-Trees
inferred← citeshttps://doi.org/10.26493/2590-9770.1422.9b6openalex-snapshot
Hierarchical and modularly-minimal vertex colorings
inferred← citeshttps://doi.org/10.48550/arxiv.0902.1364openalex-snapshot
A Note on Contractible Edges in Chordal Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1906.10031openalex-snapshot
Hierarchical Colorings of Cographs
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.