On the public citation graph

An algorithm for the enumeration of spanning trees

0 signed · 29 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.1002/net.1975.5.3.237openalex-snapshot
Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
inferredcites →https://doi.org/10.1007/bfb0092272openalex-snapshot
Analysis of a spanning tree enumeration algorithm
inferredcites →https://doi.org/10.1016/0010-4485(74)90262-0openalex-snapshot
IEEE trans. on circuit theory
inferredcites →https://doi.org/10.1109/tct.1964.1082276openalex-snapshot
Generation and Realization of Trees and k-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.1965.1082432openalex-snapshot
Generation of Trees without Duplications
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/0207024openalex-snapshot
Finding All Spanning Trees of Directed and Undirected Graphs
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_5openalex-snapshot
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
inferred← citeshttps://doi.org/10.1007/978-3-032-27732-9_3openalex-snapshot
Exact Algorithms for Edge Deletion to Cactus
inferred← citeshttps://doi.org/10.1007/978-94-011-4122-2_3openalex-snapshot
Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-981-10-3409-1_2openalex-snapshot
A Divide-and-Conquer Algorithm for All Spanning Tree Generation
inferred← citeshttps://doi.org/10.1007/978-981-33-4968-1_14openalex-snapshot
Algorithm to Generate All Spanning Tree Structures of a Complete Graph
inferred← citeshttps://doi.org/10.1007/bfb0083472openalex-snapshot
Topological network synthesis
inferred← citeshttps://doi.org/10.1007/s00373-024-02808-2openalex-snapshot
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan
inferred← citeshttps://doi.org/10.1007/s40747-018-0079-7openalex-snapshot
Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review
inferred← citeshttps://doi.org/10.1016/0165-6074(91)90417-ropenalex-snapshot
An efficient for the sequential general decomposition of sequential machines
inferred← citeshttps://doi.org/10.1016/j.laa.2020.11.003openalex-snapshot
Edge-matching graph contractions and their interlacing properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.11.018openalex-snapshot
Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph
inferred← citeshttps://doi.org/10.1109/31.20199openalex-snapshot
MOD-CHAR: an implementation of Char's spanning tree enumeration algorithm and its complexity analysis
inferred← citeshttps://doi.org/10.1109/access.2018.2872737openalex-snapshot
Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph
inferred← citeshttps://doi.org/10.1109/jiot.2021.3102130openalex-snapshot
Improving the Software-Defined Wireless Sensor Networks Routing Performance Using Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/nof50125.2020.9249110openalex-snapshot
Can Host-Based SDNs Rival the Traffic Engineering Abilities of Switch-Based SDNs?
inferred← citeshttps://doi.org/10.1142/s0129183119501006openalex-snapshot
Automatic computing of the grand potential in finite temperature many-body perturbation theory
inferred← citeshttps://doi.org/10.14778/3778092.3778098openalex-snapshot
FlowLog: Efficient and Extensible Datalog via Incrementality
inferred← citeshttps://doi.org/10.26438/ijcse/v5i10.5458openalex-snapshot
Spanning Tree- Properties, Algorithms and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1407.0699openalex-snapshot
Enumeration of Spanning Trees Using Edge Exchange with Minimal Partitioning
inferred← citeshttps://doi.org/10.5120/12994-0250openalex-snapshot
A Study on 'Number of Spanning Trees'
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.