On the public citation graph

An Algorithm for Enumerating All Spanning Trees of a Directed Graph

0 signed · 39 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.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.1002/smr.70063openalex-snapshot
Minimizing Inter‐Dependencies in Functional Requirements for Timely Delivery of Software Projects: A Prioritization Approach Using AHP and Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-031-18530-4_15openalex-snapshot
Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-11812-3_27openalex-snapshot
An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_21openalex-snapshot
Generating Paths and Cuts in Multi-pole (Di)graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_23openalex-snapshot
Minimum Leaf Out-Branching Problems
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_21openalex-snapshot
On the Enumeration of Bipartite Minimum Edge Colorings
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/s00454-009-9164-4openalex-snapshot
Fast Enumeration Algorithms for Non-crossing Geometric Graphs
inferred← citeshttps://doi.org/10.1007/s00766-023-00397-9openalex-snapshot
A hybrid technique using minimal spanning tree and analytic hierarchical process to prioritize functional requirements for parallel software development
inferred← citeshttps://doi.org/10.1007/s10955-016-1537-5openalex-snapshot
Wavelet Analysis on Symbolic Sequences and Two-Fold de Bruijn Sequences
inferred← citeshttps://doi.org/10.1007/s11269-016-1378-7openalex-snapshot
Layout and Component Size Optimization of Sewer Network Using Spanning Tree and Modified PSO Algorithm
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.032openalex-snapshot
Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
inferred← citeshttps://doi.org/10.1016/j.ijepes.2013.11.039openalex-snapshot
A reliability assessment based graph theoretical approach for feeder routing in power distribution networks including distributed generations
inferred← citeshttps://doi.org/10.1016/j.jda.2008.07.008openalex-snapshot
Algorithms for generating convex sets in acyclic digraphs
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.1049/sfw2/8819735openalex-snapshot
Design of Minimal Spanning Tree and Analytic Hierarchical Process (SAHP) Based Hybrid Technique for Software Requirements Prioritization
inferred← citeshttps://doi.org/10.1098/rsif.2019.0828openalex-snapshot
Efficient manipulation and generation of Kirchhoff polynomials for the analysis of non-equilibrium biochemical reaction networks
inferred← citeshttps://doi.org/10.1109/indcon.2012.6420700openalex-snapshot
Feeder routing in DG interfaced power distribution networks using MSTB-GT approach
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218642openalex-snapshot
Crowdsourced live streaming over the cloud
inferred← citeshttps://doi.org/10.1109/tmm.2015.2460193openalex-snapshot
Cloud-Assisted Live Streaming for Crowdsourced Multimedia Content
inferred← citeshttps://doi.org/10.1109/tnnls.2019.2928028openalex-snapshot
Output Feedback Control for Set Stabilization of Boolean Control Networks
inferred← citeshttps://doi.org/10.1109/tpami.2014.2382116openalex-snapshot
Tree Topology Estimation
inferred← citeshttps://doi.org/10.1109/tr.2009.2036712openalex-snapshot
A New Efficient Algorithm for Generating All Minimal Tie-Sets Connecting Selected Nodes in a Mesh-Structured Network
inferred← citeshttps://doi.org/10.1142/s1793830918500052openalex-snapshot
Listing all spanning trees in Halin graphs — sequential and Parallel view
inferred← citeshttps://doi.org/10.1145/1377676.1377733openalex-snapshot
Fast enumeration algorithms for non-crossing geometric graphs
inferred← citeshttps://doi.org/10.1590/s0101-74382005000200004openalex-snapshot
An algorithm to generate all spanning trees of a graph in order of increasing cost
inferred← citeshttps://doi.org/10.18653/v1/w19-3115openalex-snapshot
Transition-Based Coding and Formal Language Theory for Ordered Digraphs
inferred← citeshttps://doi.org/10.21711/231766362015/rmc4419openalex-snapshot
Polynomial enumeration of chordless cycles on cyclically orientable graphs
inferred← citeshttps://doi.org/10.26438/ijcse/v5i10.5458openalex-snapshot
Spanning Tree- Properties, Algorithms and Applications
inferred← citeshttps://doi.org/10.32657/10356/6064openalex-snapshot
Geometric design of flat layout of 3D folded structures
inferred← citeshttps://doi.org/10.47832/2717-8234.3-2.6openalex-snapshot
DESIGN AND IMPLEMENTATION OF KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM IN C++
inferred← citeshttps://doi.org/10.48550/arxiv.0801.1979openalex-snapshot
Minimum Leaf Out-branching and Related Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1309.1051openalex-snapshot
Efficient Enumeration of Chordless Cycles
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.48550/arxiv.1505.02829openalex-snapshot
Polynomial enumeration of chordless cycles on cyclically orientable graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05032openalex-snapshot
Enumerating all the Irreducible Polynomials over Finite Field
inferred← citeshttps://doi.org/10.48550/arxiv.1607.05817openalex-snapshot
Spanning Trees in 2-trees
inferred← citeshttps://doi.org/10.48550/arxiv.1811.08724openalex-snapshot
A note on Graphical Notation Reveals Topological Stability Criteria for Collective Dynamics in Complex Network
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.