Results 1 to 10 of about 124,717 (298)
Metric Dimension for Gabriel Unit Disk Graphs is NP-Complete [PDF]
, 2013 We show that finding a minimal number of landmark nodes for a unique virtual addressing by hop-distances in wireless ad-hoc sensor networks is NP-complete even if the networks are unit disk graphs that contain only Gabriel edges.
J. Díaz, P. Bose, R. Tamassia
core +3 more sources
Improper colouring of (random) unit disk graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 For any graph $G$, the $k$-improper chromatic number $χ ^k(G)$ is the smallest number of colours used in a colouring of $G$ such that each colour class induces a subgraph of maximum degree $k$.
Ross J. Kang +2 more
doaj +9 more sources
Unit Disk Graph-Based Node Similarity Index for Complex Network Analysis [PDF]
Complexity, 2019 We seek to quantify the extent of similarity among nodes in a complex network with respect to two or more node-level metrics (like centrality metrics).
Natarajan Meghanathan
doaj +2 more sources
QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs [PDF]
, 2018 A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for Maximum Clique on unit disk graphs [Clark, Colbourn, Johnson; Discrete Mathematics '90]. Since
Bonnet, E. +4 more
core +6 more sources
Is Technological Trajectory Disruptive?
Annals of Business Administrative Science, 2013 Christensen and Bower (1996) and Christensen (1997, 2003) discuss disruptive innovation by applying Dosi’s concept of disruptive technological trajectories (Dosi, 1982).
Nobuo TAKAHASHI +2 more
doaj +1 more source
Local Approximation Schemes for Ad Hoc and Sensor Networks [PDF]
, 2005 We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs.
Kuhn, F. +3 more
core +4 more sources
Density-Based clustering in mapReduce with guarantees on parallel time, space, and solution quality [PDF]
Transactions on CombinatoricsA well-known clustering problem called Density-Based Spatial Clustering of Applications with Noise~(DBSCAN) involves computing the solutions of at least one disk range query per input point, computing the connected components of a graph, and bichromatic ...
Sepideh Aghamolaei, Mohammad Ghodsi
doaj +1 more source
Approximating Minimum Independent Dominating Sets in Wireless Networks [PDF]
, 2007 We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth.
Hurink, J.L., Nieberg, T.
core +6 more sources
International Journal of Distributed Sensor Networks, 2017 The high attenuation of radio signals in water leaves acoustic waves the most viable communication media for underwater sensor networks. Nevertheless, acoustic communication suffers from significantly high latency because of its low propagation speed ...
Xin Bai, Xiaohui Wei, Sen Bai
doaj +1 more source
Spanners for geometric intersection graphs with applications
Journal of Computational Geometry, 2012 A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real numbert>1, we say that a subgraph G' of a graph G is a t-spanner of G, if for every pair of verticesu,v in G, there exists a path in G' of length at most t ...
Martin Fürer +1 more
doaj +1 more source