Results 11 to 20 of about 3,732,510 (304)
Product distance matrix of a graph and squared distance matrix of a tree [PDF]
Applicable Analysis and Discrete Mathematics, 2013 Let G be a strongly connected, weighted directed graph. We define a product distance ?(i,j) for pairs i,j of vertices and form the corresponding product distance matrix. We obtain a formula for the determinant and the inverse of the product distance matrix.
BAPAT, RB, SIVASUBRAMANIAN, S
openaire +3 more sources
Factoring distance matrix polynomials [PDF]
Discrete Mathematics, 1993 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collins, Karen L., Karen L. Collins
openaire +2 more sources
Application of Floyd's Algorithm on Transport Network of South Bohemian Region
Communications, 2016 The introductory part of the paper deals with the theory of searching for optimal routes in transport networks, including a description of each type of optimization tasks. The aim of the article is demonstration of Floyd algorithm application to find the
Jiri Hanzl +3 more
doaj +1 more source
Computing the nearest euclidean distance matrix with low embedding dimensions [PDF]
, 2013 Euclidean distance embedding appears in many high-profile applications including wireless sensor network localization, where not all pairwise distances among sensors are known or accurate.
Qi, Hou-Duo, Yuan, Xiaoming, Qi, Hou Duo
core +1 more source
On the distance matrix of a tree
Discrete Mathematics, 1976 AbstractFor a tree T on n vertices, let D(T)=(dij) denote the distance matrix of T, i.e., dij(T) is just the length of the unique path then the ith vertex and the jth vertex of T. Denote by ΔT(x) the characteristic polynom, of D(T), so that ΔT(x) = det(D(T) xl). In this paper, we investigate a number of properties of ΔT(x).
M. Edelberg +2 more
openaire +2 more sources
An algorithm for computing the distance to uncontrollability [PDF]
, 1991 Elsner L, He C. An algorithm for computing the distance to uncontrollability. Systems & Control Letters. 1991;17(6):453-464.In this paper, we present an algorithm to compute the distance to uncontrollability.
He, Chunyang, Elsner, Ludwig
core +1 more source
A note on completing quasi-distance and distance matrices
Special Matrices, 2019 We give a necessary and sufficient condition for the existence of a quasi-distance matrix where some positive off-diagonal entries have been prescribed. Moreover, we give an algorithm for obtaining such a matrix.
Zhang Yulin +2 more
doaj +1 more source
Multi-distance support matrix machines [PDF]
Pattern Recognition Letters, 2019 Real-world data such as digital images, MRI scans and electroencephalography signals are naturally represented as matrices with structural information. Most existing classifiers aim to capture these structures by regularizing the regression matrix to be low-rank or sparse.
Yunfei Ye, Dong Han
openaire +3 more sources
The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue [PDF]
, 2008 For a matrix polynomial P(λ) and a given complex number μ, we introduce a (spectral norm) distance from P(λ) to the matrix polynomials that have μ as an eigenvalue of geometric multiplicity at least κ, and a distance from P(λ) to the matrix polynomials ...
Papathanasiou, Nikolaos +3 more
core +1 more source
Vehicle Routing Optimization System with Smart Geopositioning Updates
Applied Sciences, 2021 Solving the vehicle routing problem (VRP) is one of the best-known optimization issues in the TLS (transport, logistic, spedition) branch market. Various variants of the VRP problem have been presented and discussed in the literature for many years.
Radosław Belka, Mateusz Godlewski
doaj +1 more source