On the public citation graph

Finding All Spanning Trees of Directed and Undirected Graphs

0 signed · 177 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.1109/tct.1958.1086460openalex-snapshot
Topological Network Analysis as a Computer Program
inferredcites →https://doi.org/10.1109/tct.1960.1086675openalex-snapshot
A Computational Method for Network Topology
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.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0206011openalex-snapshot
Two Algorithms for Generating Weighted Spanning Trees in Order
inferredcites →https://doi.org/10.1145/363219.363229openalex-snapshot
Algorithm 354: generator of spanning trees [H]

What points at this work

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

inferred← citeshttps://doi.org/10.0000/ijamc.2012.4.1.247openalex-snapshot
Generating all degree constrained and degree preserving spanning trees of a weighted graph in order of increasing cost
inferred← citeshttps://doi.org/10.1002/9781118033104.ch6openalex-snapshot
Matrices of a Graph
inferred← citeshttps://doi.org/10.1002/9781119801504.ch8openalex-snapshot
Microgrids with Flexible Boundaries for Service Restoration
inferred← citeshttps://doi.org/10.1002/rnc.4009openalex-snapshot
Directed spanning tree–based adaptive protocols for second‐order consensus of multiagent systems
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-1-4939-2864-4_728openalex-snapshot
Enumeration of Paths, Cycles, and Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-00834-5_16openalex-snapshot
On the Non-uniqueness of Solutions to the Perfect Phylogeny Mixture Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_5openalex-snapshot
A Combinatorial Branch and Bound for the Min-Max Regret Spanning Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_11openalex-snapshot
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails
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-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-031-27051-2_11openalex-snapshot
Inferring Strings from Position Heaps in Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-031-30448-4_26openalex-snapshot
Efficiently Enumerating All Spanning Trees of a Plane 3-Tree
inferred← citeshttps://doi.org/10.1007/978-3-031-90252-9_25openalex-snapshot
Pharming: Joint Clonal Tree Reconstruction of SNV and CNA Evolution from Single-Cell DNA Sequencing of Tumors
inferred← citeshttps://doi.org/10.1007/978-3-319-05443-8_17openalex-snapshot
Exact Methods for Resource Leveling Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_23openalex-snapshot
Generating Minimal k-Vertex Connected Spanning Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_18openalex-snapshot
Parameterized Complexity for Domination Problems on Degenerate Graphs
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/978-3-642-23719-5_24openalex-snapshot
Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_728-1openalex-snapshot
Enumeration of Paths, Cycles, and Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-29852-3_12openalex-snapshot
Finding Trusted Publish/Subscribe Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-36092-3_13openalex-snapshot
Complexity of Connectivity in Cognitive Radio Networks through Spectrum Assignment
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_53openalex-snapshot
Deeper Local Search for Better Approximation on Maximum Internal Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-94-009-5315-4_26openalex-snapshot
Introduction
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/bf01939361openalex-snapshot
An algorithm for the enumeration of spanning trees
inferred← citeshttps://doi.org/10.1007/bf02104831openalex-snapshot
Combinatorial analysis (nonnegative matrices, algorithmic problems)
inferred← citeshttps://doi.org/10.1007/bf02669835openalex-snapshot
A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs
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/bfb0028284openalex-snapshot
Algorithms for generating all spanning trees of undirected, directed and weighted graphs
inferred← citeshttps://doi.org/10.1007/bfb0083472openalex-snapshot
Topological network synthesis
inferred← citeshttps://doi.org/10.1007/bfb0092272openalex-snapshot
Analysis of a spanning tree enumeration algorithm
inferred← citeshttps://doi.org/10.1007/pl00009171openalex-snapshot
A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/s00034-013-9696-yopenalex-snapshot
Symbolic Analysis of Nullor-Based Circuits with the Two-Graph Technique
inferred← citeshttps://doi.org/10.1007/s00170-013-5181-9openalex-snapshot
An investigation of graph traversal algorithms in folded sheet metal parts design
inferred← citeshttps://doi.org/10.1007/s00186-008-0255-4openalex-snapshot
Edge-swapping algorithms for the minimum fundamental cycle basis problem
inferred← citeshttps://doi.org/10.1007/s00291-016-0435-1openalex-snapshot
Resource levelling in project scheduling with generalized precedence relationships and variable execution intensities
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/s004530010008openalex-snapshot
An Algorithm for Enumerating All Spanning Trees of a Directed Graph
inferred← citeshttps://doi.org/10.1007/s00778-026-00977-5openalex-snapshot
Efficiently querying connected components in large temporal graphs via scalable and maintainable indices
inferred← citeshttps://doi.org/10.1007/s10878-013-9605-0openalex-snapshot
On the complexity of connectivity in cognitive radio networks through spectrum assignment
inferred← citeshttps://doi.org/10.1007/s10951-010-0207-8openalex-snapshot
Exact methods for the resource levelling problem
inferred← citeshttps://doi.org/10.1007/s10955-005-8080-0openalex-snapshot
Ninth and Tenth Order Virial Coefficients for Hard Spheres in D Dimensions
inferred← citeshttps://doi.org/10.1007/s11222-011-9281-9openalex-snapshot
Algorithmic parameterization of mixed treatment comparisons
inferred← citeshttps://doi.org/10.1007/s11276-014-0784-0openalex-snapshot
An exact algorithm for maximum lifetime data gathering tree without aggregation in wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s40565-014-0056-0openalex-snapshot
A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration
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.1007/s41109-022-00502-xopenalex-snapshot
Chained structure of directed graphs with applications to social and transportation networks
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/b978-0-12-041420-8.50018-7openalex-snapshot
RELIABILITY CALCULATION AND INDUCTIVE INFERENCE: AN OVERVIEW
inferred← citeshttps://doi.org/10.1016/j.bdr.2019.07.002openalex-snapshot
Parallelizing Computations of Full Disjunctions
inferred← citeshttps://doi.org/10.1016/j.bpj.2017.11.3780openalex-snapshot
Steady-State Differential Dose Response in Biological Systems
inferred← citeshttps://doi.org/10.1016/j.cels.2016.07.004openalex-snapshot
Inferring the Mutational History of a Tumor Using Multi-state Perfect Phylogeny Mixtures
inferred← citeshttps://doi.org/10.1016/j.cels.2019.05.010openalex-snapshot
CALDER: Inferring Phylogenetic Trees from Longitudinal Tumor Samples
inferred← citeshttps://doi.org/10.1016/j.comnet.2022.109418openalex-snapshot
A comprehensive multi-topology minimum set cover link-state routing approach for emerging random all-IP access network topologies
inferred← citeshttps://doi.org/10.1016/j.cor.2011.03.010openalex-snapshot
Enumerating all spanning trees for pairwise comparisons
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.026openalex-snapshot
Listing minimal edge-covers of intersecting families with applications to connectivity problems
inferred← citeshttps://doi.org/10.1016/j.dam.2023.10.025openalex-snapshot
Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.067openalex-snapshot
Generating 3-vertex connected spanning subgraphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2012.03.003openalex-snapshot
Mixed-integer linear programming for resource leveling problems
inferred← citeshttps://doi.org/10.1016/j.ijepes.2012.04.032openalex-snapshot
Load type impact on distribution system reconfiguration
inferred← citeshttps://doi.org/10.1016/j.jcss.2008.04.003openalex-snapshot
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
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.nahs.2017.12.001openalex-snapshot
Consensus of nonlinear multi-agent systems with directed switching graphs: A directed spanning tree based error system approach
inferred← citeshttps://doi.org/10.1016/j.nahs.2018.04.004openalex-snapshot
Stabilizability analysis and switching signals design of switched Boolean networks
inferred← citeshttps://doi.org/10.1016/j.nahs.2019.05.005openalex-snapshot
Observer-based consensus for multi-agent systems with partial adaptive dynamic protocols
inferred← citeshttps://doi.org/10.1016/j.physa.2019.02.047openalex-snapshot
Influential node ranking via randomized spanning trees
inferred← citeshttps://doi.org/10.1016/j.rineng.2025.106506openalex-snapshot
Steiner eccentricity: Predictions and applications
inferred← citeshttps://doi.org/10.1016/j.simpa.2021.100083openalex-snapshot
tinygarden — A java package for testing properties of spanning trees
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.1016/s0020-0190(99)00117-9openalex-snapshot
Memory-efficient enumeration of constrained spanning trees
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00391-3openalex-snapshot
The problem of the optimal biobjective spanning tree
inferred← citeshttps://doi.org/10.1016/s0895-7177(02)00096-1openalex-snapshot
An algorithm to generate all spanning trees with flow
inferred← citeshttps://doi.org/10.1017/9781108649018openalex-snapshot
Quantitative Analysis of Ecological Networks
inferred← citeshttps://doi.org/10.1038/s41586-024-07359-3openalex-snapshot
3D genomic mapping reveals multifocality of human pancreatic precancers
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.1080/00207179.2013.829605openalex-snapshot
A consensus protocol under directed communications with two time delays and delay scheduling
inferred← citeshttps://doi.org/10.1080/00207721.2014.886745openalex-snapshot
Stability of formation control using a consensus protocol under directed communications with two time delays and delay scheduling
inferred← citeshttps://doi.org/10.1080/02331938808843366openalex-snapshot
Designing a minimal spanning tree network subject to a budget constraint
inferred← citeshttps://doi.org/10.1080/03081079.2019.1585432openalex-snapshot
The (logarithmic) least squares optimality of the arithmetic (geometric) mean of weight vectors calculated from all spanning trees for incomplete additive (multiplicative) pairwise comparison matrices
inferred← citeshttps://doi.org/10.1080/03772063.1989.11436825openalex-snapshot
Microprocessor Based Char's Tree Enumeration Algorithm
inferred← citeshttps://doi.org/10.1088/1751-8121/ac515fopenalex-snapshot
Obtaining the long-term behavior of master equations with finite state space from the structure of the associated state transition network
inferred← citeshttps://doi.org/10.1088/1751-8121/acee35openalex-snapshot
Explicit expressions for stationary states of the Lindblad equation for a finite state space
inferred← citeshttps://doi.org/10.1089/cmb.1994.1.51openalex-snapshot
Constructing Aligned Sequence Blocks
inferred← citeshttps://doi.org/10.1093/bioinformatics/btac367openalex-snapshot
Estimation of cancer cell fractions and clone trees from multi-region sequencing of tumors
inferred← citeshttps://doi.org/10.1093/bioinformatics/btq508openalex-snapshot
Using coalitional games on biological networks to measure centrality and power of genes
inferred← citeshttps://doi.org/10.1093/bioinformatics/btx270openalex-snapshot
Tumor phylogeny inference using tree-constrained importance sampling
inferred← citeshttps://doi.org/10.1098/rspb.2018.2727openalex-snapshot
Neural arbors are Pareto optimal
inferred← citeshttps://doi.org/10.1101/2020.06.11.146100openalex-snapshot
Reconstructing tumor evolutionary histories and clone trees in polynomial-time with SubMARine
inferred← citeshttps://doi.org/10.1101/526814openalex-snapshot
Inferring tumor evolution from longitudinal samples
inferred← citeshttps://doi.org/10.1103/physrevlett.104.048703openalex-snapshot
Fluctuations and Redundancy in Optimal Transport Networks
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/82.728846openalex-snapshot
Symbolic network analysis methods for practical analog integrated circuits: a survey
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/aispas.1997.581705openalex-snapshot
A parallel algorithm for k-minimum spanning trees
inferred← citeshttps://doi.org/10.1109/bibm.2018.8621437openalex-snapshot
Examining Tumor Phylogeny Inference in Noisy Sequencing Data
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/dmc62632.2024.10812158openalex-snapshot
Data-Driven Graph Switching for Cyber-Resilient Control in Microgrids
inferred← citeshttps://doi.org/10.1109/ei2.2017.8245254openalex-snapshot
Robust optimal protection strategy against false data injection attacks in power grids
inferred← citeshttps://doi.org/10.1109/iccw.2016.7503795openalex-snapshot
Multipath routing for mmWave WMN backhaul
inferred← citeshttps://doi.org/10.1109/icde.2014.6816753openalex-snapshot
GQBE: Querying knowledge graphs by example entity tuples
inferred← citeshttps://doi.org/10.1109/icde.2016.7498391openalex-snapshot
Querying knowledge Graphs By Example entity tuples
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218642openalex-snapshot
Crowdsourced live streaming over the cloud
inferred← citeshttps://doi.org/10.1109/iscc.2015.7405564openalex-snapshot
Constructing an optimal spanning tree over a hybrid network with SDN and legacy switches
inferred← citeshttps://doi.org/10.1109/issnip.2014.6827596openalex-snapshot
Finding the maximum lifetime data-gathering tree in sensor networks
inferred← citeshttps://doi.org/10.1109/jsyst.2009.2037287openalex-snapshot
Efficient Spanning Tree Enumeration Using Loop Domain
inferred← citeshttps://doi.org/10.1109/pscc.2016.7541010openalex-snapshot
A method for the evaluation and optimisation of power losses and reliability of supply in a distribution network
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.1109/tcns.2020.3027788openalex-snapshot
Set Invariance and Optimal Set Stabilization of Boolean Control Networks: A Graphical Approach
inferred← citeshttps://doi.org/10.1109/tcs.1984.1085435openalex-snapshot
Complexity of computation of a spanning tree enumeration algorithm
inferred← citeshttps://doi.org/10.1109/tkde.2015.2426696openalex-snapshot
Querying Knowledge Graphs by Example Entity Tuples
inferred← citeshttps://doi.org/10.1109/tmc.2017.2741479openalex-snapshot
Analysis of Practical Aspects of Multi-Plane Routing-Based Load Balancing Approach for Future Link-State Convergent All-IP Access Networks
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/tnse.2020.3008678openalex-snapshot
On Enumeration of Spanning Arborescences and Reliability for Network Broadcast in Fixed-Schedule Dynamic Networks
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.1109/tsg.2020.2985087openalex-snapshot
Radiality Constraints for Resilient Reconfiguration of Distribution Systems: Formulation and Application to Microgrid Formation
inferred← citeshttps://doi.org/10.1109/tsg.2020.3038214openalex-snapshot
Switch Status Identification in Distribution Networks Using Harmonic Synchrophasor Measurements
inferred← citeshttps://doi.org/10.1109/wcnc.2017.7925488openalex-snapshot
A Coalitional Graph Game for Device-to-Device Data Dissemination with Power Budget Constraints
inferred← citeshttps://doi.org/10.1109/wcnc.2018.8377073openalex-snapshot
A novel minimum set cover routing plane construction approach for random wireless IP access networks
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1988.tb35325.xopenalex-snapshot
The Kinetic Mechanism(s) of Cytochrome Oxidase
inferred← citeshttps://doi.org/10.1137/16m1088685openalex-snapshot
Distributed Consensus for Multiagent Systems via Directed Spanning Tree Based Adaptive Control
inferred← citeshttps://doi.org/10.1137/s009753979225030xopenalex-snapshot
Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
inferred← citeshttps://doi.org/10.1137/s0097539794270881openalex-snapshot
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
inferred← citeshttps://doi.org/10.1142/s0129054125500054openalex-snapshot
Efficiently Enumerating Spanning Trees of k -Trees
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/3589315openalex-snapshot
On Querying Connected Components in Large Temporal Graphs
inferred← citeshttps://doi.org/10.1145/3592128openalex-snapshot
Image vectorization and editing via linear gradient layer decomposition
inferred← citeshttps://doi.org/10.1145/3771997openalex-snapshot
Fast Assessment of Eulerian Trails in Graphs with Applications
inferred← citeshttps://doi.org/10.1186/s12920-019-0626-0openalex-snapshot
Parameter, noise, and tree topology effects in tumor phylogeny inference
inferred← citeshttps://doi.org/10.1186/s13015-019-0155-6openalex-snapshot
Implications of non-uniqueness in phylogenetic deconvolution of bulk DNA samples of tumors
inferred← citeshttps://doi.org/10.1186/s13059-015-0647-8openalex-snapshot
Fast and scalable inference of multi-sample cancer lineages
inferred← citeshttps://doi.org/10.1287/mnsc.29.1.93openalex-snapshot
On the General Feasibility Test of Scheduling Lot Sizes for Several Products on One Machine
inferred← citeshttps://doi.org/10.1287/opre.32.3.478openalex-snapshot
A Survey of Network Reliability and Domination Theory
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1008400openalex-snapshot
Reconstructing tumor evolutionary histories and clone trees in polynomial-time with SubMARine
inferred← citeshttps://doi.org/10.14418/wes01.2.346openalex-snapshot
An Accounting of Colorings of Graphs
inferred← citeshttps://doi.org/10.14464/gammas.v4i1.503openalex-snapshot
A method for finding all connections in the Pantelides algorithm for delay differential-algebraic equations
inferred← citeshttps://doi.org/10.1504/ijict.2011.041928openalex-snapshot
A constrained crawling approach and its application to a specialised search engine
inferred← citeshttps://doi.org/10.15439/2015f249openalex-snapshot
Genetic Algorithms for Balanced Spanning Tree Problem
inferred← citeshttps://doi.org/10.15807/jorsj.38.331openalex-snapshot
EFFICIENTLY SCANNING ALL SPANNING TREES OF AN UNDIRECTED GRAPH
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.17485/ijst/2016/v9i10/70674openalex-snapshot
System Reliability Evaluation of a Stochastic - Flow Network using Spanning Trees
inferred← citeshttps://doi.org/10.21711/231766362017/rmc4511openalex-snapshot
On the problem of finding all minimum spanning trees
inferred← citeshttps://doi.org/10.22215/etd/2018-13266openalex-snapshot
FSM Testing Based on Transition Trees and Complete Round Trip Paths Testing Criteria
inferred← citeshttps://doi.org/10.23919/cnsm67658.2025.11297417openalex-snapshot
LCDN: Providing Network Determinism with Low-Cost Switches
inferred← citeshttps://doi.org/10.25335/cw39-hy43openalex-snapshot
Edge Impact in Graphs and Social Network Matrix Completion
inferred← citeshttps://doi.org/10.26438/ijcse/v5i10.5458openalex-snapshot
Spanning Tree- Properties, Algorithms and Applications
inferred← citeshttps://doi.org/10.30534/ijatcse/2019/41842019openalex-snapshot
Computing the number of spanning trees in the Wheel multiple graph
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2591openalex-snapshot
Broadcast in sparse conversion optical networks using fewest converters
inferred← citeshttps://doi.org/10.32657/10356/6064openalex-snapshot
Geometric design of flat layout of 3D folded structures
inferred← citeshttps://doi.org/10.3389/fmtec.2025.1439421openalex-snapshot
Extraction of exact symbolic stationary probability formulas for Markov chains with finite space with application to production lines. Part I: description of methodology
inferred← citeshttps://doi.org/10.3389/fmtec.2025.1439429openalex-snapshot
Extraction of exact symbolic stationary probability formulas for Markov chains in finite space with application to production lines. part II: unveiling accurate formulas for very short serial production lines without buffers (three- and four-stations)
inferred← citeshttps://doi.org/10.3390/s21217254openalex-snapshot
Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
inferred← citeshttps://doi.org/10.3390/sym17050741openalex-snapshot
Performance Prediction of Store and Forward Telemedicine Using Graph Theoretic Approach of Symmetry Queueing Network
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.960-961.943openalex-snapshot
A Novel Genetic Algorithm Based on all Spanning Trees of Undirected Graph for Distribution Network Reconfiguration
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.1301.0995openalex-snapshot
On the Complexity of Connectivity in Cognitive Radio Networks Through Spectrum Assignment
inferred← citeshttps://doi.org/10.48550/arxiv.1408.3977openalex-snapshot
Spanning Tree Enumeration in 2-trees: Sequential and Parallel Perspective
inferred← citeshttps://doi.org/10.48550/arxiv.1412.8574openalex-snapshot
Fast and Scalable Inference of Multi-Sample Cancer Lineages
inferred← citeshttps://doi.org/10.48550/arxiv.1503.07224openalex-snapshot
Distribution System Topology Detection Using Consumer Load and Line Flow Measurements
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02605openalex-snapshot
Multi-State Perfect Phylogeny Mixture Deconvolution and Applications to Cancer Sequencing
inferred← citeshttps://doi.org/10.48550/arxiv.1605.05102openalex-snapshot
Enumeration of Enumeration Algorithms
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
inferred← citeshttps://doi.org/10.5220/0002516100310038openalex-snapshot
AUTOJOIN: PROVIDING FREEDOM FROM SPECIFYING JOINS
inferred← citeshttps://doi.org/10.64898/2026.01.15.699695openalex-snapshot
Reconstructing clone-resolved transcriptional programs from bulk tumor sequencing
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.