Results 1 to 10 of about 114,934,093 (299)
Steiner Distance in Product Networks [PDF]
For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the \emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. Let $n$ and $k$ be two integers with $2\
Yaping Mao, Eddie Cheng, Zhao Wang
doaj +4 more sources
Phylogenetic Networks as Circuits With Resistance Distance [PDF]
Phylogenetic networks are notoriously difficult to reconstruct. Here we suggest that it can be useful to view unknown genetic distance along edges in phylogenetic networks as analogous to unknown resistance in electric circuits. This resistance distance,
Stefan Forcey, Drew Scalzo
doaj +4 more sources
Two-hop distance estimation in wireless sensor networks
In wireless sensor networks, the accurate estimation of distances between sensor nodes is essential. In addition to the distance information available for immediate neighbors within a sensing range, the distance estimation of two-hop neighbors can be ...
Sunyong Kim +5 more
doaj +2 more sources
Computing Sharp Bounds of Metric Based Fractional Dimensions for the Sierpinski Networks
The concept of metric dimension is widely applied to solve various problems in the different fields of computer science and chemistry, such as computer networking, integer programming, robot navigation, and the formation of chemical structuring.
Arooba Fatima +2 more
doaj +1 more source
As information flows at ever-increasing speeds across technological innovation networks, it is crucial to optimize reciprocity among partnering enterprises.
Dongping Yu +3 more
doaj +1 more source
Lower and Upper Bounds of Fractional Metric Dimension of Connected Networks
The distance centric parameter in the theory of networks called by metric dimension plays a vital role in encountering the distance-related problems for the monitoring of the large-scale networks in the various fields of chemistry and computer science ...
Muhammad Javaid +5 more
doaj +1 more source
Sharp Bounds of Local Fractional Metric Dimensions of Connected Networks
Metric dimension is a distance based parameter which is used to determine the locations of machines (or robots) with respect to minimum consumption of time, shortest distance among the destinations and lesser number of the utilized nodes as places of the
Muhammad Javaid +3 more
doaj +1 more source
Distance Entropy Cartography Characterises Centrality in Complex Networks
We introduce distance entropy as a measure of homogeneity in the distribution of path lengths between a given node and its neighbours in a complex network.
Massimo Stella, Manlio De Domenico
doaj +1 more source
In this paper, we present a new method for detecting overlapping communities in networks with a predefined number of clusters called LPAM (Link Partitioning Around Medoids).
Alexander Ponomarenko +2 more
doaj +1 more source
Optimal Data Structures for Farthest-Point Queries in Cactus Networks
Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance.
Prosenjit Bose +4 more
doaj +1 more source

