On the public citation graph
An empirical analysis of algorithms for constructing a minimum spanning tree
0 signed · 59 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/bf01840439openalex-snapshot
The pairing heap: A new form of self-adjusting heap
inferredcites →https://doi.org/10.1007/bf02579168openalex-snapshot
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
inferredcites →https://doi.org/10.1016/0020-0190(75)90001-0openalex-snapshot
Priority queues with update and finding minimum spanning trees
inferredcites →https://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1109/fscs.1990.89594openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1109/mahc.1985.10011openalex-snapshot
On the History of the Minimum Spanning Tree Problem
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/28869.28874openalex-snapshot
Fibonacci heaps and their uses in improved network optimization algorithms
inferredcites →https://doi.org/10.1145/50087.50096openalex-snapshot
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
inferredcites →https://doi.org/10.1145/5684.5686openalex-snapshot
An empirical comparison of priority-queue and event-set implementations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9781119750673.ch9openalex-snapshot
Diatom Morphospaces, Tree Spaces and Lineage Crown Groups
inferred← citeshttps://doi.org/10.1002/9783527638079.ch4openalex-snapshot
Transcriptional Network Inference Based on Information Theory
inferred← citeshttps://doi.org/10.1007/3-540-45678-3_43openalex-snapshot
Shortest Path Algorithms: Engineering Aspects
inferred← citeshttps://doi.org/10.1007/3-540-46521-9_2openalex-snapshot
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
inferred← citeshttps://doi.org/10.1007/978-3-030-10837-3_11openalex-snapshot
Computational Models for Cancer Phylogenetics
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_61openalex-snapshot
A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
inferred← citeshttps://doi.org/10.1007/978-3-642-59179-2_10openalex-snapshot
Computation of Constrained Spanning Trees: A Unified Approach
inferred← citeshttps://doi.org/10.1007/bfb0038190openalex-snapshot
How to find a minimum spanning tree in practice
inferred← citeshttps://doi.org/10.1007/s00453-010-9400-6openalex-snapshot
On Sorting, Heaps, and Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/s11107-015-0510-6openalex-snapshot
Green IP over WDM mesh networks with connection availability guarantee
inferred← citeshttps://doi.org/10.1007/s12532-009-0002-8openalex-snapshot
Blossom V: a new implementation of a minimum cost perfect matching algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00194-8openalex-snapshot
A generalization of binomial queues
inferred← citeshttps://doi.org/10.1016/0167-8191(95)00010-0openalex-snapshot
Minimum-weight degree-constrained spanning tree problem: Heuristics and implementation on an SIMD parallel machine
inferred← citeshttps://doi.org/10.1016/j.pscychresns.2018.05.001openalex-snapshot
fMRI classification method with multiple feature fusion based on minimum spanning tree analysis
inferred← citeshttps://doi.org/10.1016/j.softx.2021.100869openalex-snapshot
JHeaps: An open-source library of priority queues
inferred← citeshttps://doi.org/10.1080/00207160211289openalex-snapshot
Random-tree Diameter and the Diameter-constrained MST
inferred← citeshttps://doi.org/10.1088/0957-0233/17/6/022openalex-snapshot
Finding minimum spanning trees more efficiently for tile-based phase unwrapping
inferred← citeshttps://doi.org/10.1109/12.247847openalex-snapshot
An optimal graph-construction approach to placing program signatures for signature monitoring
inferred← citeshttps://doi.org/10.1109/4235.850653openalex-snapshot
A new evolutionary approach to the degree-constrained minimum spanning tree problem
inferred← citeshttps://doi.org/10.1109/csde53843.2021.9718401openalex-snapshot
Using Score-based Structure Learning to Computationally Learn Direct Influence between Hierarchical Dynamic Bayesian Networks
inferred← citeshttps://doi.org/10.1109/icera66156.2025.11087267openalex-snapshot
Optimal Design of the Cable Layout in a Wind Farm Using Modified Prime Algorithm
inferred← citeshttps://doi.org/10.1109/icse56004.2022.9863174openalex-snapshot
Levenberg-Marquardt Backpropagation model augmented with Prim's algorithm approach (LMBP) to minimize power in FSM synthesis
inferred← citeshttps://doi.org/10.1109/tbme.2015.2468578openalex-snapshot
A Minimum Spanning Forest-Based Method for Noninvasive Cancer Detection With Hyperspectral Imaging
inferred← citeshttps://doi.org/10.1109/tmc.2006.1599408openalex-snapshot
Mobile telemedicine sensor networks with low-energy data query and network lifetime considerations
inferred← citeshttps://doi.org/10.1118/1.4931958openalex-snapshot
A minimum spanning forest based classification method for dedicated breast CT images
inferred← citeshttps://doi.org/10.1137/1.9781611972863.16openalex-snapshot
Optimal Incremental Sorting
inferred← citeshttps://doi.org/10.1137/1.9781611973198.7openalex-snapshot
A Back-to-Basics Empirical Study of Priority Queues
inferred← citeshttps://doi.org/10.1145/1137856.1137884openalex-snapshot
I/O-efficient batched union-find and its applications to terrain analysis
inferred← citeshttps://doi.org/10.1145/1868237.1868249openalex-snapshot
I/O-efficient batched union-find and its applications to terrain analysis
inferred← citeshttps://doi.org/10.1179/000870408x276594openalex-snapshot
Unfolding the Earth: Myriahedral Projections
inferred← citeshttps://doi.org/10.1201/9781315119335-7openalex-snapshot
Binomial, Fibonacci, and Pairing Heaps
inferred← citeshttps://doi.org/10.1371/journal.pone.0249014openalex-snapshot
Societal context-dependent multi-modal transportation network augmentation in Johannesburg, South Africa
inferred← citeshttps://doi.org/10.14232/phd.11555openalex-snapshot
Integrating Blockchain and Fog Computing Technologies for Efficient Privacy-preserving Systems
inferred← citeshttps://doi.org/10.3390/s23031239openalex-snapshot
Optimizing Resources and Increasing the Coverage of Internet-of-Things (IoT) Networks: An Approach Based on LoRaWAN
inferred← citeshttps://doi.org/10.47749/t/unicamp.2000.262983openalex-snapshot
Problemas combinatorios de congestionamento
inferred← citeshttps://doi.org/10.5194/isprs-archives-xlii-2-w13-1333-2019openalex-snapshot
RANKING NODES IN COMPLEX NETWORKS: A CASE STUDY OF THE GAUBUS
inferred← citeshttps://doi.org/10.56816/2378-6949.1044openalex-snapshot
Verification of Costless Merge Pairing Heaps
inferred← citeshttps://doi.org/10.5772/intechopen.111033openalex-snapshot
Internet of Things - New Insights [Working Title]
inferred← citeshttps://doi.org/10.5772/intechopen.113328openalex-snapshot
Hybrid Architectures to Improve Coverage in Remote Areas and Incorporate Long-Range LPWAN Multi-Hop IoT Strategies
inferred← citeshttps://doi.org/10.59254/sbpo-2018-85400openalex-snapshot
Análise de complexidade assintótica de algoritmos em grafos por uma abordagem empírica
inferred← citeshttps://doi.org/10.70675/0aae3b61z8b26z4ec5z8a82z26c49b824fe3openalex-snapshot
A myocardial perfusion simulation pipeline based on machine-learning computational methods
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.