Search
Search Results
-
MCMSTClustering: defining non-spherical clusters by using minimum spanning tree over KD-tree-based micro-clusters
Clustering is a technique for statistical data analysis and is widely used in many areas where class labels are not available. Major problems related...
-
A spanning tree approach to social network sampling with degree constraints
Online social networks (OSNs) have become increasingly popular on the web in recent years. There are millions of users on these networks, and they...
-
Colored Constrained Spanning Tree on Directed Graphs
We study the \(\kappa \) -Colored Constrained Spanning Tree...
-
NP-Completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
Undirected multiple graphs of any natural multiplicity k > 1 are studied. There are edges of three types: ordinary edges, multiple edges, and...
-
A Novel Fuzzy Distance-Based Minimum Spanning Tree Clustering Algorithm for Face Detection
Solving a clustering algorithm can usually be simplified into an optimization problem. Using relevant knowledge in graph theory, many optimization...
-
MCMSTStream: applying minimum spanning tree to KD-tree-based micro-clusters to define arbitrary-shaped clusters in streaming data
Stream clustering has emerged as a vital area for processing streaming data in real-time, facilitating the extraction of meaningful information....
-
Efficiently Enumerating All Spanning Trees of a Plane 3-Tree
A spanning tree T of a connected, undirected graph G is an acyclic subgraph having all vertices and a minimal number of edges of G connecting those...
-
Better Hardness Results for the Minimum Spanning Tree Congestion Problem
In the spanning tree congestion problem, given a connected graph G, the objective is to compute a spanning tree T in G for which the maximum edge...
-
Intersection of random spanning trees in complex networks
In their previous work, the authors considered the concept of random spanning tree intersection of complex networks (London and Pluhár, in: Cherifi,...
-
A Hybrid Steady-State Genetic Algorithm for the Minimum Conflict Spanning Tree Problem
This paper studies a hybrid approach for the minimum conflict spanning tree (MCST) problem, where the MCST problem deals with finding a spanning tree...
-
Performance analysis of evolutionary algorithm for the maximum internal spanning tree problem
The maximum internal spanning tree (MIST) problem is to find a spanning tree with maximum number of internal node for an undirected graph. It is a...
-
Simulated Annealing is a Polynomial-Time Approximation Scheme for the Minimum Spanning Tree Problem
We prove that Simulated Annealing with an appropriate cooling schedule computes arbitrarily tight constant-factor approximations to the minimum...
-
On Conflict-Free Spanning Tree: Algorithms and Complexity
A natural constraint in real-world applications is to avoid conflicting elements in the solution of problems. Given an undirected graph...
-
Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints
We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via...
-
A hybrid technique using minimal spanning tree and analytic hierarchical process to prioritize functional requirements for parallel software development
Software for large enterprises such as the enterprise resource planning (ERP) is more likely to be developed by a team of software developers where...
-
A Self-stabilizing Minimum Average Stretch Spanning Tree Construction
Stretch is a metric in the construction of spanning trees that measures the deviation in the distance between a pair of nodes in the tree compared to...
-
A PGAS-Based Implementation for the Parallel Minimum Spanning Tree Algorithm
The minimum spanning tree is a critical problem for many applications in network analysis, communication network design, and computer science. The...
-
Geometric Spanning Trees Minimizing the Wiener Index
The Wiener index of a network, introduced by the chemist Harry Wiener [30], is the sum of distances between all pairs of nodes in the network. This...
-
Incremental algorithms for the maximum internal spanning tree problem
The maximum internal spanning tree (MIST) problem is utilized to determine a spanning tree in a graph G , with the maximum number of possible internal...
-
Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming Distance
Given a undirected connected weighted graph G and a forest F of G, the partial inverse min-max spanning tree problem is to adjust weight function...