On the public citation graph
Algorithms for finding optimum trees: Description, use and evaluation
0 signed · 43 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.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf02288326openalex-snapshot
A hybrid algorithm for finding thekth smallest ofn elements in O(n) time
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/0020-0190(75)90056-3openalex-snapshot
An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
inferredcites →https://doi.org/10.1016/0020-0190(78)90030-3openalex-snapshot
The min-max spanning tree problem and some extensions
inferredcites →https://doi.org/10.1016/0166-218x(85)90058-7openalex-snapshot
On the value of a random minimum spanning tree problem
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1109/sfcs.1984.715935openalex-snapshot
Efficient Implementation Of Graph Algorithms Using Contraction
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1145/321879.321884openalex-snapshot
Efficiency of a Good But Not Linear Set Union Algorithm
inferredcites →https://doi.org/10.1145/800193.569966openalex-snapshot
Computing minimum spanning trees efficiently
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200003)35:2<118::aid-net3>3.0.co;2-mopenalex-snapshot
State space partition algorithms for stochastic systems with applications to minimum spanning trees
inferred← citeshttps://doi.org/10.1002/1520-6750(199204)39:3<399::aid-nav3220390309>3.0.co;2-0openalex-snapshot
The quadratic minimum spanning tree problem
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/978-3-662-06913-4_4openalex-snapshot
Lineare Optimierungsprobleme mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/978-3-662-48216-2_4openalex-snapshot
Lineare Optimierungsprobleme mit spezieller Struktur
inferred← citeshttps://doi.org/10.1007/bf02936178openalex-snapshot
An optimal pram algorithm for a spanning tree on trapezoid graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00125-vopenalex-snapshot
An O(log n) parallel algorithm for constructing a spanning tree on permutation graphs
inferred← citeshttps://doi.org/10.1016/j.apm.2015.06.017openalex-snapshot
Hydraulic modelling of closed pipes in loop equations of water distribution networks
inferred← citeshttps://doi.org/10.1016/j.dam.2024.04.003openalex-snapshot
The constrained Bottleneck Spanning Tree Problem with upgrades
inferred← citeshttps://doi.org/10.1016/j.flowmeasinst.2016.12.002openalex-snapshot
Hydraulic modelling of control devices in loop equations of water distribution networks
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/s0926-907x(05)80041-8openalex-snapshot
Eye-Gaze Determination Of User Intent At The Computer Interface
inferred← citeshttps://doi.org/10.1023/a:1008340311108openalex-snapshot
Minimum Spanning Trees with Sums of Ratios
inferred← citeshttps://doi.org/10.1051/matecconf/201929001011openalex-snapshot
Reimagining vision with infinity mirrors
inferred← citeshttps://doi.org/10.1137/s1052623494265359openalex-snapshot
Applying a Newton Method to Strictly Convex Separable Network Quadratic Programs
inferred← citeshttps://doi.org/10.1145/355017.355028openalex-snapshot
Identifying fixations and saccades in eye-tracking protocols
inferred← citeshttps://doi.org/10.1518/107118193784162272openalex-snapshot
Eye-Gaze Control of the Computer Interface: Discrimination of Zoom Intent
inferred← citeshttps://doi.org/10.3389/fphys.2025.1661026openalex-snapshot
Vision toolkit part 2. features and metrics for assessing oculomotor signal: a review
inferred← citeshttps://doi.org/10.3758/bf03200428openalex-snapshot
Eye-gaze-contingent control of the computer interface: Methodology and example for zoom detection
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.