Results 261 to 270 of about 142,780 (319)
Recomb-Mix: fast and accurate local ancestry inference. [PDF]
BioinformaticsWei Y, Zhi D, Zhang S.
europepmc +1 more source
Linear-Time Approximation Algorithms for Unit Disk Graphs
, 2014 Guilherme D. da Fonseca +2 more
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Vertex-Edge Domination in Unit Disk Graphs
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
S. Jena, G. Das
semanticscholar +2 more sources
Algorithms and Turing Kernels for Detecting and Counting Small Patterns in Unit Disk Graphs
arXiv.org, 2023In this paper we investigate the parameterized complexity of the task of counting and detecting occurrences of small patterns in unit disk graphs: Given an $n$-vertex unit disk graph $G$ with an embedding of ply $p$ (that is, the graph is represented as ...
Jesper Nederlof, Krisztina Szil'agyi
semanticscholar +1 more source
Algorithmica, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gräf, A., Stumpf, M., Weißenfels, G.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gräf, A., Stumpf, M., Weißenfels, G.
openaire +1 more source
Proceedings of the 2004 joint workshop on Foundations of mobile computing, 2004
Finding a good embedding of a unit disk graph given by its connectivity information is a problem of practical importance in a variety of fields. In wireless ad hoc and sensor networks, such an embedding can be used to obtain virtual coordinates. In this paper, we prove a non-approximability result for the problem of embedding a given unit disk graph ...
Fabian Kuhn +2 more
openaire +1 more source
Finding a good embedding of a unit disk graph given by its connectivity information is a problem of practical importance in a variety of fields. In wireless ad hoc and sensor networks, such an embedding can be used to obtain virtual coordinates. In this paper, we prove a non-approximability result for the problem of embedding a given unit disk graph ...
Fabian Kuhn +2 more
openaire +1 more source
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs
International Symposium on Computational Geometry, 2021We consider the problem of computing shortest paths in weighted unit-disk graphs in constant dimension d. Although the single-source and all-pairs variants of this problem are wellstudied in the plane case, no non-trivial exact distance oracles for unit ...
Adam Karczmarz +2 more
semanticscholar +1 more source
International Symposium on Computational Geometry
In a series of papers, Avraham, Filtser, Kaplan, Katz, and Sharir (SoCG'14), Kaplan, Katz, Saban, and Sharir (ESA'23), and Katz, Saban, and Sharir (ESA'24) studied a class of geometric optimization problems -- including reverse shortest path in ...
Timothy M. Chan, Zhengcheng Huang
semanticscholar +1 more source
In a series of papers, Avraham, Filtser, Kaplan, Katz, and Sharir (SoCG'14), Kaplan, Katz, Saban, and Sharir (ESA'23), and Katz, Saban, and Sharir (ESA'24) studied a class of geometric optimization problems -- including reverse shortest path in ...
Timothy M. Chan, Zhengcheng Huang
semanticscholar +1 more source
Minimum Selective Subset on Unit Disk Graphs and Circle Graphs
arXiv.orgIn a connected simple graph G = (V(G),E(G)), each vertex is assigned one of c colors, where V(G) can be written as a union of a total of c subsets V_{1},...,V_{c} and V_{i} denotes the set of vertices of color i.
Bubai Manna
semanticscholar +1 more source