Results 11 to 20 of about 116,078 (220)
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
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 +3 more sources
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
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
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
Planar subgraphs without low-degree nodes [PDF]
, 2011 We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k.
A. Liebers +9 more
core +2 more sources
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
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.
S. S. Ravi +4 more
openaire +2 more sources
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
Minimum Bisection Is NP-hard on Unit Disk Graphs [PDF]
Information and Computation, 2014 17 pages, 6 ...
Díaz Cort, Josep, Mertzios, George B.
openaire +8 more sources