On the public citation graph
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
0 signed · 495 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/net.3230010305openalex-snapshot
A simple derivation of edmonds' algorithm for optimum branchings
inferredcites →https://doi.org/10.1002/net.3230090403openalex-snapshot
A note on finding optimum branchings
inferredcites →https://doi.org/10.1007/bf02579443openalex-snapshot
Linear verification for 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/0196-6774(84)90042-7openalex-snapshot
Efficient algorithms for a family of matroid intersection problems
inferredcites →https://doi.org/10.1109/mahc.1985.10011openalex-snapshot
On the History of the Minimum Spanning Tree Problem
inferredcites →https://doi.org/10.1109/sfcs.1984.715934openalex-snapshot
Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms
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/322154.322161openalex-snapshot
Applications of Path Compression on Balanced Trees
inferredcites →https://doi.org/10.1145/62.2160openalex-snapshot
Worst-case Analysis of Set Union Algorithms
inferredcites →https://doi.org/10.1145/65950.65954openalex-snapshot
Efficient implementation of graph algorithms using contraction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0037(200103)37:2<74::aid-net2>3.0.co;2-eopenalex-snapshot
A branch and cut method for the degree-constrained minimum spanning tree problem
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.1002/9780470400531.eorms0816openalex-snapshot
Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1002/9781118445112.stat06487openalex-snapshot
Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1002/net.20476openalex-snapshot
The complexity of the node capacitated in‐tree packing problem
inferred← citeshttps://doi.org/10.1002/net.21698openalex-snapshot
Mixed planar and network single‐facility location problems
inferred← citeshttps://doi.org/10.1002/net.3230240705openalex-snapshot
Efficient algorithms for minimum range cut problems
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.1006/jagm.1993.1010openalex-snapshot
Approximation Algorithms for Graph Augmentation
inferred← citeshttps://doi.org/10.1006/jagm.1994.1033openalex-snapshot
Offline Algorithms for Dynamic Minimum Spanning Tree Problems
inferred← citeshttps://doi.org/10.1006/jctb.1998.1817openalex-snapshot
An Efficient Algorithm for Minimum-Weight Bibranching
inferred← citeshttps://doi.org/10.1006/jpdc.1995.1157openalex-snapshot
A Technique to Speed Up Parallel Fully Dynamic Algorithms for MST
inferred← citeshttps://doi.org/10.1007/0-387-25036-0_2openalex-snapshot
Problems in Data Structures and Algorithms
inferred← citeshttps://doi.org/10.1007/0-387-28600-4_8openalex-snapshot
Predictive Coding of Hyperspectral Images
inferred← citeshttps://doi.org/10.1007/1-4020-4761-4_27openalex-snapshot
Compression of hyperspectral imagery via linear prediction
inferred← citeshttps://doi.org/10.1007/11731139_56openalex-snapshot
Improved Negative-Border Online Mining Approaches
inferred← citeshttps://doi.org/10.1007/11764298_27openalex-snapshot
Updating Directed Minimum Cost Spanning Trees
inferred← citeshttps://doi.org/10.1007/11775096_32openalex-snapshot
Weighted Broadcast in Linear Radio Networks
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_73openalex-snapshot
Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
inferred← citeshttps://doi.org/10.1007/3-540-16766-8_16openalex-snapshot
Exploiting hierarchy in VLSI design
inferred← citeshttps://doi.org/10.1007/3-540-29297-7_6openalex-snapshot
Spanning Trees and Arborescences
inferred← citeshttps://doi.org/10.1007/3-540-36136-7_14openalex-snapshot
A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_6openalex-snapshot
An Optimal Minimum Spanning Tree Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-45365-2_3openalex-snapshot
An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
inferred← citeshttps://doi.org/10.1007/3-540-46004-7_11openalex-snapshot
A Memetic Algorithm for Vertex-Biconnectivity Augmentation
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_101openalex-snapshot
On matroids and hierarchical graphs
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_76openalex-snapshot
Finding the k smallest spanning trees
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_85openalex-snapshot
Approximation algorithms for graph augmentation
inferred← citeshttps://doi.org/10.1007/3-540-56279-6_55openalex-snapshot
The k-edge-connectivity augmentation problem of weighted graphs
inferred← citeshttps://doi.org/10.1007/3-540-58078-6_2openalex-snapshot
Optimal parallel verification of minimum spanning trees in logarithmic time
inferred← citeshttps://doi.org/10.1007/3-540-58184-7_143openalex-snapshot
Batch dynamic algorithms for two graph problems
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_94openalex-snapshot
Linear-time algorithms for parametric minimum spanning tree problems on planar graphs
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_135openalex-snapshot
Steiner problems on directed acyclic graphs
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_128openalex-snapshot
Using sparsification for parametric minimum spanning tree problems
inferred← citeshttps://doi.org/10.1007/3-540-61626-8_106openalex-snapshot
Representation of the gabow algorithm for finding smallest spanning trees with a degree constraint on associative parallel processors
inferred← citeshttps://doi.org/10.1007/3-540-62559-3_24openalex-snapshot
Modifying networks to obtain low cost trees
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_325openalex-snapshot
Randomized Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_18openalex-snapshot
Steiner Tree Problems in Telecommunications
inferred← citeshttps://doi.org/10.1007/978-0-387-74905-1_33openalex-snapshot
Tabu Search Algorithm Based on Strategic Oscillation for Nonlinear Minimum Spanning Tree Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_13openalex-snapshot
Modern Heuristic Search Methods for the Steiner Tree Problem in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_325openalex-snapshot
Randomized Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-2-287-99037-3_6openalex-snapshot
Arbres couvrants et arborescences
inferred← citeshttps://doi.org/10.1007/978-3-030-57980-7_11openalex-snapshot
Bribery and Control in Stable Marriage
inferred← citeshttps://doi.org/10.1007/978-3-030-79527-6_20openalex-snapshot
Approximate Minimum Directed Spanning Trees Under Congestion
inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_4openalex-snapshot
From Symmetry to Asymmetry: Generalizing TSP Approximations by Parametrization
inferred← citeshttps://doi.org/10.1007/978-3-030-94822-1_9openalex-snapshot
One-Shot Wayfinding Method for Blind People via OCR and Arrow Analysis with a 360-Degree Smartphone Camera
inferred← citeshttps://doi.org/10.1007/978-3-031-57942-4_43openalex-snapshot
Hop-Constrained Oblivious Routing Using Prim’s-Sollin’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-032-00281-5_10openalex-snapshot
Complexity of Solo Chess with Unlimited Moves
inferred← citeshttps://doi.org/10.1007/978-3-032-05711-2_7openalex-snapshot
Complete Pareto Front of the Biobjective Minimum Length Minimum Risk Spanning Trees Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-06706-7_10openalex-snapshot
Low Recourse Arborescence Forests Under Uniformly Random Arcs
inferred← citeshttps://doi.org/10.1007/978-3-319-11433-0_12openalex-snapshot
Extended Tree Augmented Naive Classifier
inferred← citeshttps://doi.org/10.1007/978-3-319-23063-4_14openalex-snapshot
Extracting Configuration Guidance Models from Business Process Repositories
inferred← citeshttps://doi.org/10.1007/978-3-319-24024-4_11openalex-snapshot
An Optimal Parallel Algorithm for Minimum Spanning Trees in Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-24282-8_23openalex-snapshot
An Algorithm for Influence Maximization in a Two-Terminal Series Parallel Graph and its Application to a Real Network
inferred← citeshttps://doi.org/10.1007/978-3-319-25255-1_57openalex-snapshot
On Coherent Indented Tree Visualization of RDF Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-56608-5_24openalex-snapshot
Feature-Oriented Analysis of User Profile Completion Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_15openalex-snapshot
The Weighted Arborescence Constraint
inferred← citeshttps://doi.org/10.1007/978-3-322-89113-6_5openalex-snapshot
Graphen und Graph-Algorithmen
inferred← citeshttps://doi.org/10.1007/978-3-322-91882-6_5openalex-snapshot
Graphen und Graph-Algorithmen
inferred← citeshttps://doi.org/10.1007/978-3-322-92105-5_5openalex-snapshot
Graphen und Graph-Algorithmen
inferred← citeshttps://doi.org/10.1007/978-3-540-30536-1_33openalex-snapshot
Restoration of Virtual Private Networks with QoS Guarantees in the Pipe Model
inferred← citeshttps://doi.org/10.1007/978-3-540-71844-4_6openalex-snapshot
Spanning Trees and Arborescences
inferred← citeshttps://doi.org/10.1007/978-3-540-74356-9_23openalex-snapshot
A Lagrangian-Based Algorithm for a Combinatorial Motion Planning Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-76796-1_9openalex-snapshot
Linear Time Approximation Algorithms for Degree Constrained Subgraph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-76919-4_6openalex-snapshot
Aufspannende Bäume und Arboreszenzen
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_12openalex-snapshot
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_23openalex-snapshot
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_10openalex-snapshot
On Minimum Changeover Cost Arborescences
inferred← citeshttps://doi.org/10.1007/978-3-642-24488-9_6openalex-snapshot
Spanning Trees and Arborescences
inferred← citeshttps://doi.org/10.1007/978-3-642-25401-7_6openalex-snapshot
Aufspannende Bäume und Arboreszenzen
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_15openalex-snapshot
Robustness of Minimum Cost Arborescences
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_325-2openalex-snapshot
Randomized Minimum Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-71388-0_36openalex-snapshot
Hierarchische Darstellung Geometrischer Objekte und Ihre Algorithmische Bedeutung
inferred← citeshttps://doi.org/10.1007/978-3-642-78910-6_160openalex-snapshot
Steiner Tree Heuristics — A Survey
inferred← citeshttps://doi.org/10.1007/978-3-662-21708-5_6openalex-snapshot
Spanning Trees and Arborescences
inferred← citeshttps://doi.org/10.1007/978-3-662-21711-5_6openalex-snapshot
Spanning Trees and Arborescences
inferred← citeshttps://doi.org/10.1007/978-3-662-56039-6_6openalex-snapshot
Spanning Trees and Arborescences
inferred← citeshttps://doi.org/10.1007/978-3-662-57691-5_6openalex-snapshot
Aufspannende Bäume und Arboreszenzen
inferred← citeshttps://doi.org/10.1007/978-88-470-1523-4_6openalex-snapshot
Alberi di supporto e arborescenze
inferred← citeshttps://doi.org/10.1007/978-90-481-8581-8_11openalex-snapshot
Auto-contractive Maps, the H Function, and the Maximally Regular Graph (MRG): A New Methodology for Data Mining
inferred← citeshttps://doi.org/10.1007/978-90-481-8581-8_14openalex-snapshot
How to Perform Data Mining: The “Persons Arrested” Dataset
inferred← citeshttps://doi.org/10.1007/978-94-007-4914-6_18openalex-snapshot
Data Mining Using Nonlinear Auto-Associative Artificial Neural Networks: The Arrestee Dataset
inferred← citeshttps://doi.org/10.1007/978-981-10-8968-8_10openalex-snapshot
KMST+: A K-Means++-Based Minimum Spanning Tree Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-99-3243-6_5openalex-snapshot
A Short Sketch of Solid Algorithms for Feedback Arc Set
inferred← citeshttps://doi.org/10.1007/bf00259471openalex-snapshot
Proving relative lower bounds for incremental algorithms
inferred← citeshttps://doi.org/10.1007/bf01188580openalex-snapshot
Combinatorial algorithms for DNA sequence assembly
inferred← citeshttps://doi.org/10.1007/bf01294129openalex-snapshot
Balancing minimum spanning trees and shortest-path trees
inferred← citeshttps://doi.org/10.1007/bf01585864openalex-snapshot
An efficient approximation algorithm for the survivable network design problem
inferred← citeshttps://doi.org/10.1007/bf01586946openalex-snapshot
Facets of two Steiner arborescence polyhedra
inferred← citeshttps://doi.org/10.1007/bf01589417openalex-snapshot
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
inferred← citeshttps://doi.org/10.1007/bf01840439openalex-snapshot
The pairing heap: A new form of self-adjusting heap
inferred← citeshttps://doi.org/10.1007/bf01994879openalex-snapshot
Finding thek smallest spanning trees
inferred← citeshttps://doi.org/10.1007/bf02523235openalex-snapshot
Optimal parallel verification of minimum spanning trees in logarithmic time
inferred← citeshttps://doi.org/10.1007/bf02614369openalex-snapshot
Dynamic trees as search trees via euler tours, applied to the network simplex algorithm
inferred← citeshttps://doi.org/10.1007/bf02684360openalex-snapshot
Spanning trees and shortest paths in monge graphs
inferred← citeshttps://doi.org/10.1007/bf02911265openalex-snapshot
Efficient associative algorithm to find the least spanning tree of a graph with a node degree constraint
inferred← citeshttps://doi.org/10.1007/bf02936178openalex-snapshot
An optimal pram algorithm for a spanning tree on trapezoid graphs
inferred← citeshttps://doi.org/10.1007/bfb0028252openalex-snapshot
Efficient algorithms for the minimum range cut problems
inferred← citeshttps://doi.org/10.1007/bfb0028278openalex-snapshot
Offline algorithms for dynamic minimum spanning tree problems
inferred← citeshttps://doi.org/10.1007/bfb0028279openalex-snapshot
An empirical analysis of algorithms for constructing a minimum spanning tree
inferred← citeshttps://doi.org/10.1007/bfb0030828openalex-snapshot
The multi-weighted spanning tree problem
inferred← citeshttps://doi.org/10.1007/bfb0038190openalex-snapshot
How to find a minimum spanning tree in practice
inferred← citeshttps://doi.org/10.1007/bfb0049420openalex-snapshot
An o(n) work EREW parallel algorithm for updating MST
inferred← citeshttps://doi.org/10.1007/pl00009170openalex-snapshot
On Constructing Minimum Spanning Trees in R k 1
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/s00012-019-0608-2openalex-snapshot
Arithmetic and k-maximality of the cyclic free magma
inferred← citeshttps://doi.org/10.1007/s00186-015-0505-1openalex-snapshot
Exact algorithms for the solution of the grey pattern quadratic assignment problem
inferred← citeshttps://doi.org/10.1007/s00446-021-00398-3openalex-snapshot
A distributed algorithm for directed minimum-weight spanning tree
inferred← citeshttps://doi.org/10.1007/s00453-009-9377-1openalex-snapshot
An Efficient Scaling Algorithm for the Minimum Weight Bibranching Problem
inferred← citeshttps://doi.org/10.1007/s00453-018-0426-5openalex-snapshot
Counting Minimum Weight Arborescences
inferred← citeshttps://doi.org/10.1007/s00778-026-00989-1openalex-snapshot
On querying minimum spanning tree in temporal graphs
inferred← citeshttps://doi.org/10.1007/s10107-006-0043-yopenalex-snapshot
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation
inferred← citeshttps://doi.org/10.1007/s10107-010-0397-zopenalex-snapshot
A weighted independent even factor algorithm
inferred← citeshttps://doi.org/10.1007/s10115-022-01748-8openalex-snapshot
Risk-aware temporal cascade reconstruction to detect asymptomatic cases
inferred← citeshttps://doi.org/10.1007/s10207-020-00533-4openalex-snapshot
Automatic analysis of attack graphs for risk mitigation and prioritization on large-scale and complex networks in Industry 4.0
inferred← citeshttps://doi.org/10.1007/s10458-023-09597-7openalex-snapshot
Fine-grained view on bribery for group identification
inferred← citeshttps://doi.org/10.1007/s10479-006-0043-6openalex-snapshot
Minimum spanning trees in networks with varying edge weights
inferred← citeshttps://doi.org/10.1007/s10479-015-1797-5openalex-snapshot
New local searches for solving the multi-source Weber problem
inferred← citeshttps://doi.org/10.1007/s10878-005-5487-0openalex-snapshot
Two Variations of the Minimum Steiner Problem
inferred← citeshttps://doi.org/10.1007/s10898-014-0183-1openalex-snapshot
Solving the planar p-median problem by variable neighborhood and concentric searches
inferred← citeshttps://doi.org/10.1007/s10898-022-01163-xopenalex-snapshot
Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
inferred← citeshttps://doi.org/10.1007/s10958-016-2695-3openalex-snapshot
On Coefficients of the Characteristic Polynomial of the Laplace Matrix of a Weighted Digraph and the All Minors Theorem
inferred← citeshttps://doi.org/10.1007/s10958-023-06666-wopenalex-snapshot
Algorithm for Sequential Construction of Spanning Minimal Directed Forests
inferred← citeshttps://doi.org/10.1007/s10994-020-05886-4openalex-snapshot
Unsupervised representation learning with Minimax distance measures
inferred← citeshttps://doi.org/10.1007/s11241-011-9122-0openalex-snapshot
Efficient verification of distributed real-time systems with broadcasting behaviors
inferred← citeshttps://doi.org/10.1007/s11590-020-01627-7openalex-snapshot
On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane $${\mathbb {R}}^2$$
inferred← citeshttps://doi.org/10.1007/s12190-025-02735-2openalex-snapshot
Exploring domination in strongly connected product fuzzy digraphs: an optimised perspective
inferred← citeshttps://doi.org/10.1007/s12555-018-0057-2openalex-snapshot
Allocating Minimum Number of Leaders for Seeking Consensus over Directed Networks with Time-varying Nonlinear Multi-agents
inferred← citeshttps://doi.org/10.1007/s13160-012-0072-2openalex-snapshot
Shortest bibranchings and valuated matroid intersection
inferred← citeshttps://doi.org/10.1007/s13160-012-0079-8openalex-snapshot
Robustness of minimum cost arborescences
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90089-0openalex-snapshot
A linear-time algorithm for finding a minimum spanning pseudoforest
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90232-7openalex-snapshot
On matroids and hierarchial graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90185-copenalex-snapshot
Worst-case performance of some heuristics for Steiner's problem in directed graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00031-7openalex-snapshot
1-Approximation algorithm for bottleneck disjoint path matching
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/0166-218x(94)00095-uopenalex-snapshot
The minimum spanning tree problem on a planar graph
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00114-4openalex-snapshot
Constrained matroidal bottleneck problems
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90051-6openalex-snapshot
k-Sum optimization problems
inferred← citeshttps://doi.org/10.1016/0196-6774(87)90042-3openalex-snapshot
Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs
inferred← citeshttps://doi.org/10.1016/0196-6774(88)90031-4openalex-snapshot
Algorithms for two bottleneck optimization problems
inferred← citeshttps://doi.org/10.1016/0196-6774(91)90026-uopenalex-snapshot
Transitive compaction in parallel via branchings
inferred← citeshttps://doi.org/10.1016/0377-2217(91)90073-5openalex-snapshot
A linear time algorithm for the maximum capacity path problem
inferred← citeshttps://doi.org/10.1016/b978-0-12-805166-5.00002-2openalex-snapshot
Glossary of Mathematical Optimization Terminology
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50010-3openalex-snapshot
Spanning Trees and Spanners
inferred← citeshttps://doi.org/10.1016/j.adhoc.2013.06.004openalex-snapshot
An exploration of aggregation convergecast scheduling
inferred← citeshttps://doi.org/10.1016/j.amc.2004.06.051openalex-snapshot
Fuzzy quadratic minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.artint.2008.03.004openalex-snapshot
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
inferred← citeshttps://doi.org/10.1016/j.artint.2016.07.003openalex-snapshot
Building knowledge maps of Web graphs
inferred← citeshttps://doi.org/10.1016/j.automatica.2025.112290openalex-snapshot
Algorithms enhancement for optimal triggering control in logical dynamic systems: Leveraging data structure storage
inferred← citeshttps://doi.org/10.1016/j.cor.2011.05.019openalex-snapshot
An LP-based heuristic algorithm for the node capacitated in-tree packing problem
inferred← citeshttps://doi.org/10.1016/j.cor.2014.05.010openalex-snapshot
New heuristic algorithms for solving the planar p-median problem
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106248openalex-snapshot
A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.10.002openalex-snapshot
The saga of minimum spanning trees
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.01.001openalex-snapshot
Semi-preemptive routing on a linear and circular track
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.07.036openalex-snapshot
Minimax regret spanning arborescences under uncertain costs
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.06.001openalex-snapshot
Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.05.058openalex-snapshot
Designing and computing explanations for comparisons inferred from an additive value model
inferred← citeshttps://doi.org/10.1016/j.endm.2012.10.030openalex-snapshot
Generating good starting solutions for the p-median problem in the plane
inferred← citeshttps://doi.org/10.1016/j.eswa.2012.02.090openalex-snapshot
A random fuzzy minimum spanning tree problem through a possibility-based value at risk model
inferred← citeshttps://doi.org/10.1016/j.eswa.2024.124997openalex-snapshot
A key distribution technique for wireless sensor networks using spanning trees
inferred← citeshttps://doi.org/10.1016/j.eswa.2026.133565openalex-snapshot
Boosting urban housing price forecasting with an innovative directed graph neural model
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.09.330openalex-snapshot
Root Cause Diagnosis of Process Faults Using Conditional Granger Causality Analysis and Maximum Spanning Tree
inferred← citeshttps://doi.org/10.1016/j.ijar.2015.04.006openalex-snapshot
Learning extended tree augmented naive structures
inferred← citeshttps://doi.org/10.1016/j.ins.2014.10.012openalex-snapshot
A fast minimum spanning tree algorithm based on K-means
inferred← citeshttps://doi.org/10.1016/j.ins.2022.07.170openalex-snapshot
Efficient edge filtering of directly-follows graphs for process mining
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.09.022openalex-snapshot
Approximating optimum branchings in linear time
inferred← citeshttps://doi.org/10.1016/j.jclepro.2025.147256openalex-snapshot
Toward climate-resilient supply chains: Analyzing the impact and mechanisms of physical climate risks on supply chain network in China’s listed companies
inferred← citeshttps://doi.org/10.1016/j.jcss.2023.03.007openalex-snapshot
From symmetry to asymmetry: Generalizing TSP approximations by parametrization
inferred← citeshttps://doi.org/10.1016/j.jcss.2024.103596openalex-snapshot
On computing optimal temporal branchings and spanning subgraphs
inferred← citeshttps://doi.org/10.1016/j.jvcir.2015.07.012openalex-snapshot
Semantic content-based image retrieval: A comprehensive study
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.2019.05.005openalex-snapshot
Observer-based consensus for multi-agent systems with partial adaptive dynamic protocols
inferred← citeshttps://doi.org/10.1016/j.omega.2004.03.005openalex-snapshot
Dynamic vehicle routing for online B2C delivery
inferred← citeshttps://doi.org/10.1016/j.osnem.2021.100138openalex-snapshot
A Trust based Privacy Providing Model for Online Social Networks
inferred← citeshttps://doi.org/10.1016/j.physa.2019.04.095openalex-snapshot
Containment control of directed networks with time-varying nonlinear multi-agents using minimum number of leaders
inferred← citeshttps://doi.org/10.1016/j.physrep.2016.04.005openalex-snapshot
Combining complex networks and data mining: Why and how
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.016openalex-snapshot
Compressing table data with column dependency
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.05.012openalex-snapshot
On finding optimal polytrees
inferred← citeshttps://doi.org/10.1016/j.ymeth.2014.01.012openalex-snapshot
Proteome compression via protein domain compositions
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00220-4openalex-snapshot
The expected complexity of Prim's minimum spanning tree algorithm
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00285-xopenalex-snapshot
Evolutionary local search for the edge-biconnectivity augmentation problem
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00323-4openalex-snapshot
A note on practical construction of maximum bandwidth paths
inferred← citeshttps://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
showing the first 200 of 477 · page through all 477
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.