Results 41 to 50 of about 124,454 (161)
Isolated singularities of the prescribed mean curvature equation in Minkowski $3$-space [PDF]
, 2017 We give a classification of non-removable isolated singularities for real analytic solutions of the prescribed mean curvature equation in Minkowski $3 ...
Gálvez, José A. +2 more
core +2 more sources
Good quality virtual realization of unit disk graphs
Journal of Computational Geometry, 2011 We consider the problem of finding a realization of an n-vertex unit disk graph (UDG) expressed in general form, say, as an adjacency matrix. The problem is to construct an embedding of the graph in low-dimensional Euclidean space so that the ratio of ...
Sriram Pemmaraju, Imran Pirwani
doaj +1 more source
Triangles and Girth in Disk Graphs and Transmission Graphs [PDF]
, 2019 Let S subset R^2 be a set of n sites, where each s in S has an associated radius r_s > 0. The disk graph D(S) is the undirected graph with vertex set S and an undirected edge between two sites s, t in S if and only if |st|
Kaplan, Haim +5 more
core +3 more sources
Stabbing line segments with disks: complexity and approximation algorithms [PDF]
, 2017 Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii $r>0$ where the set of segments forms a straight line drawing $G=(V,E)$ of
Kobylkin, Konstantin
core +1 more source
, 2011 We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an $n\times n$ 0-1 matrix $C,$ let $K_{C}$ be the complete weighted graph on the rows of $C$ where the weight of an edge ...
Lingas, Andrzej, Sledneu, Dzmitry
core +1 more source
Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information
International Journal of Distributed Sensor Networks, 2014 This paper develops an efficient and distributed boundary detection algorithm to precisely recognize wireless sensor network (WSN) boundaries using only local connectivity information.
Baoqi Huang +3 more
doaj +1 more source
Hyperbolic intersection graphs and (quasi)-polynomial time
, 2019 We study unit ball graphs (and, more generally, so-called noisy uniform ball graphs) in $d$-dimensional hyperbolic space, which we denote by $\mathbb{H}^d$.
Kisfaludi-Bak, Sándor
core +1 more source
Connectivity of Graphs Induced by Directional Antennas [PDF]
, 2010 This paper addresses the problem of finding an orientation and a minimum radius for directional antennas of a fixed angle placed at the points of a planar set S, that induce a strongly connected communication graph. We consider problem instances in which
Damian, Mirela, Flatland, Robin
core
Black holes, complex curves, and graph theory: Revising a conjecture by Kasner
Nuclear Physics BThe ratios 8/9=22/3≈0.9428 and 3/2≈0.866 appear in various contexts of black hole physics, as values of the charge-to-mass ratio Q/M or the rotation parameter a/M for Reissner-Nordström and Kerr black holes, respectively.
Yen Chin Ong
doaj +1 more source
An Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
, 2017 Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLS$_o$) algorithm to solve minimum dominating set problem in large graphs ...
Chalupa, David
core +1 more source