Results 11 to 20 of about 124,454 (161)
Simple heuristics for unit disk graphs [PDF]
Networks, 1995 AbstractUnit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP‐hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring, and minimum dominating set.
Marathe, M. V. +4 more
openaire +3 more sources
On Forbidden Induced Subgraphs for Unit Disk Graphs [PDF]
Discrete & Computational Geometry, 2018 A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active study of unit disk graphs very little is known about minimal forbidden induced subgraphs for this class. We found
Aistis Atminas, Viktor Zamaraev
openaire +5 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
Improper Colourings of Unit Disk Graphs
Electronic Notes in Discrete Mathematics, 2005 AbstractMotivated by a satellite communications problem, we consider a generalized coloring problem on unit disk graphs. A coloring is k‐improper if no more than k neighbors of every vertex have the same colour as that assigned to the vertex. The k‐improper chromatic number χk(G) is the least number of colors needed in a k‐improper coloring of a graph ...
Havet, Frédéric +2 more
openaire +3 more sources
Balanced Line Separators of Unit Disk Graphs [PDF]
Computational Geometry, 2017 We prove a geometric version of the graph separator theorem for the unit disk intersection graph: for any set of $n$ unit disks in the plane there exists a line $\ell$ such that $\ell$ intersects at most $O(\sqrt{(m+n)\log{n}})$ disks and each of the halfplanes determined by $\ell$ contains at most $2n/3$ unit disks from the set, where $m$ is the ...
Carmi, Paz +8 more
openaire +3 more sources
Unit Disk Graph-Based Node Similarity Index for Complex Network Analysis
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 +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
Strongly Hyperbolic Unit Disk Graphs
, 2021 The class of Euclidean unit disk graphs is one of the most fundamental and well-studied graph classes with underlying geometry. In this paper, we identify this class as a special case in the broader class of hyperbolic unit disk graphs and introduce strongly hyperbolic unit disk graphs as a natural counterpart to the Euclidean variant.
Bläsius, Thomas +3 more
openaire +8 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