Results 41 to 50 of about 596,753 (209)
Let G be a graph of order n. If the maximal connected subgraph of G has no cut vertex then it is called a block. If each block of graph G is a clique then G is called clique tree.
Shaowei Sun +2 more
doaj +1 more source
On the determinant of q-distance matrix of a graph
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li Hong-Hai, Su Li, Zhang Jing
openaire +2 more sources
The calculation of the distance to a nearby defective matrix [PDF]
SUMMARYThe distance of a matrix to a nearby defective matrix is an important classical problem in numerical linear algebra, as it determines how sensitive or ill‐conditioned an eigenvalue decomposition of a matrix is. The concept has been discussed throughout the history of numerical linear algebra, and the problem of computing the nearest defective ...
Richard O. Akinola +2 more
openaire +1 more source
Realizing the distance matrix of a graph
An explicit description is given for the unique graph with as few arcs (each bearing a positive length) as possible, which has a prescribed matrix of shortest-path distances between pairs of distinct vertices.
Goldman, A. J.
core +1 more source
The presented notes focus partially on two of the basic elements (accessibility and image) of any managed tourism destination from the perspective of basic ETL processes over open and third-party data.
Csaba Sidor +2 more
doaj +1 more source
Note on distance matrix hashing
Hashing algorithm of dynamical set of distances is described. Proposed hashing function is residual.
openaire +2 more sources
On spectral radius of the generalized distance matrix of a graph [PDF]
Shariefuddin Pirzada
doaj +1 more source
Classified AGV Material Flow and Layout Data Set for Multidisciplinary Investigation
Automated Guided Vehicles (AGV) are increasingly used in industry to automate material flow tasks. To efficiently operate systems of AGVs, researchers have proposed many different planning and control methods, e.g., for scheduling, dispatching, and ...
Marvin Sperling +4 more
doaj +1 more source
Support Values for Genome Phylogenies
We have recently developed a distance metric for efficiently estimating the number of substitutions per site between unaligned genome sequences. These substitution rates are called “anchor distances” and can be used for phylogeny reconstruction.
Fabian Klötzl, Bernhard Haubold
doaj +1 more source
On the relationship between the Hausdorff distance and matrix distances of ellipsoids
AbstractThe space of ellipsoids may be metrized by the Hausdorff distance or by the sum of the distance between their centers and a distance between matrices. Various inequalities between metrics are established. It follows that the square root of positive semidefinite symmetric matrices satisfies a Lipschitz condition, with a constant which depends ...
Goffin, Jean-Louis, Hoffman, Alan J.
openaire +2 more sources

