On the public citation graph
An algorithm for enumerating all directed spanning trees in a directed graph
0 signed · 27 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/bfb0028284openalex-snapshot
Algorithms for generating all spanning trees of undirected, directed and weighted graphs
inferredcites →https://doi.org/10.1016/0022-0000(83)90006-5openalex-snapshot
A data structure for dynamic trees
inferredcites →https://doi.org/10.1109/sfcs.1992.267818openalex-snapshot
Sparsification-a technique for speeding up dynamic graph algorithms
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0207024openalex-snapshot
Finding All Spanning Trees of Directed and Undirected Graphs
inferredcites →https://doi.org/10.1137/0214055openalex-snapshot
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
inferredcites →https://doi.org/10.1137/s0097539794270881openalex-snapshot
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
inferredcites →https://doi.org/10.1145/265910.265914openalex-snapshot
Sparsification—a technique for speeding up dynamic graph algorithms
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/978-3-030-63007-2_55openalex-snapshot
Creation of a Dependency Tree for Sentences in the Kazakh Language
inferred← citeshttps://doi.org/10.1007/978-3-540-24571-1_55openalex-snapshot
A Web Page Scoring Method for Local Web Search Engines
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/s00283-014-9503-zopenalex-snapshot
All Solutions to the Immobilizer Problem
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.dam.2013.02.033openalex-snapshot
Inferring strings from suffix trees and links on a binary alphabet
inferred← citeshttps://doi.org/10.1061/(asce)wr.1943-5452.0001629openalex-snapshot
Network Subsystems for Water Distribution System Optimization
inferred← citeshttps://doi.org/10.1061/9780784484258.103openalex-snapshot
Utilization of Network Subsystems for Designing a Level-1 Redundant Water Distribution Network
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/dyspan.2007.46openalex-snapshot
Efficient Routing Algorithms for Multi-Channel Dynamic Spectrum Access Networks
inferred← citeshttps://doi.org/10.1109/jsyst.2009.2037287openalex-snapshot
Efficient Spanning Tree Enumeration Using Loop Domain
inferred← citeshttps://doi.org/10.1186/preaccept-7974442751493852openalex-snapshot
A framework for modelling gene regulation which accommodates non-equilibrium mechanisms
inferred← citeshttps://doi.org/10.3390/w14152443openalex-snapshot
Network Subsystems for Robust Design Optimization of Water Distribution Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6477openalex-snapshot
Analytical Equilibrium Solutions of Biochemical Systems with Synthesis and Degradation
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.1602.05032openalex-snapshot
Enumerating all the Irreducible Polynomials over Finite Field
inferred← citeshttps://doi.org/10.48550/arxiv.1611.07649openalex-snapshot
A Novel Control-flow based Intrusion Detection Technique for Big Data Systems
inferred← citeshttps://doi.org/10.7236/jiwit.2012.12.3.51openalex-snapshot
A Prim Minimum Spanning Tree Algorithm for Directed Graph
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.