Results 11 to 20 of about 83,874 (238)
Network Localization on Unit Disk Graphs [PDF]
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011 5 ...
Nattakan Puttarak +2 more
openaire +3 more sources
Discrete Mathematics, 1990 AbstractUnit disk graphs are the intersection graphs of equal sized circles in the plane: they provide a graph-theoretic model for broadcast networks (cellular networks) and for some problems in computational geometry. We show that many standard graph theoretic problems remain NP-complete on unit disk graphs, including coloring, independent set ...
Charles J. Colbourn +5 more
openaire +2 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 +5 more sources
Advanced Materials Interfaces, EarlyView., 2023 This review discusses the use of Surface‐Enhanced Raman Spectroscopy (SERS) combined with Artificial Intelligence (AI) for detecting antimicrobial resistance (AMR). Various SERS studies used with AI techniques, including machine learning and deep learning, are analyzed for their advantages and limitations.
Zakarya Al‐Shaebi +4 more
wiley +1 more source
Distributed coloring and the local structure of unit-disk graphs [PDF]
Theoretical Computer Science, 2021 25 pages, corrects a mistake in the proceedings version of the paper. A preliminary version of this work appeared in the proceedings of the 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2021)
Louis Esperet +2 more
openaire +5 more sources
Max-Cut and Max-Bisection are NP-hard on unit disk graphs [PDF]
, 2006 We prove that the Max-Cut and Max-Bisection problems are NP-hard on unit disk graphs. We also show that $\lambda$-precision graphs are planar for $\lambda$ > 1 / \sqrt{2}$
Diaz, Josep, Kaminski, Marcin
core +3 more sources
Minimum Clique Partition in Unit Disk Graphs [PDF]
Graphs and Combinatorics, 2011 Comment: 12 pages, 3 ...
Dumitrescu, Adrian, Pach, János
openaire +4 more sources
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 +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
Identifying and locating-dominating codes in (random) geometric networks [PDF]
, 2009 International audienceWe model a problem about networks built from wireless devices using identifying and locating-dominating codes in unit disk graphs. It is known that minimising the size of an identifying code is NP-complete even for bipartite graphs.
Müller, Tobias, Sereni, Jean-Sébastien
core +3 more sources