On the public citation graph
Algorithms for generating all spanning trees of undirected, directed and weighted graphs
0 signed · 18 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.1002/net.1975.5.3.237openalex-snapshot
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
inferredcites →https://doi.org/10.1109/tct.1965.1082385openalex-snapshot
A Simple Algorithm for Listing All the Trees of a Graph
inferredcites →https://doi.org/10.1109/tct.1968.1082817openalex-snapshot
Generation of Trees, Two-Trees, and Storage of Master Forests
inferredcites →https://doi.org/10.1137/0206011openalex-snapshot
Two Algorithms for Generating Weighted Spanning Trees in Order
inferredcites →https://doi.org/10.1137/0207024openalex-snapshot
Finding All Spanning Trees of Directed and Undirected 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-49381-6_31openalex-snapshot
New Approach for Speeding Up Enumeration Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-60220-8_82openalex-snapshot
Faster enumeration of all spanning trees of a directed graph
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_19openalex-snapshot
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
inferred← citeshttps://doi.org/10.1007/bfb0009492openalex-snapshot
An algorithm for enumerating all directed spanning trees in a directed graph
inferred← citeshttps://doi.org/10.1007/bfb0045114openalex-snapshot
Enumerating triangulations for products of two simplices and for arbitrary configurations of points
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.033openalex-snapshot
Inferring strings from suffix trees and links on a binary alphabet
inferred← citeshttps://doi.org/10.1016/j.ejor.2013.02.036openalex-snapshot
Design and dimensioning of hydrogen transmission pipeline networks
inferred← citeshttps://doi.org/10.1109/cdc.2017.8263881openalex-snapshot
Understanding the discrete genetic toggle switch phenomena using a discrete ‘nullcline’ construct inspired by the Markov chain tree theorem
inferred← citeshttps://doi.org/10.1109/compsac.2017.128openalex-snapshot
Finding All Breadth First Full Spanning Trees in a Directed Graph
inferred← citeshttps://doi.org/10.1109/csae.2011.5952415openalex-snapshot
Topological algorithm for linear multi-port network functions determination
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00076openalex-snapshot
Traversing combinatorial 0/1-polytopes via optimization
inferred← citeshttps://doi.org/10.1109/sm2acd.2010.5672365openalex-snapshot
Enumerating all the spanning trees in an un-oriented graph - A novel approach
inferred← citeshttps://doi.org/10.1137/23m1612019openalex-snapshot
Traversing Combinatorial 0/1-Polytopes via Optimization
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.