Results 31 to 40 of about 83,874 (238)
Computing a maximum clique in geometric superclasses of disk graphs
, 2020 In the 90's Clark, Colbourn and Johnson wrote a seminal paper where they proved that maximum clique can be solved in polynomial time in unit disk graphs.
A Bar-Noy +7 more
core +1 more source
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
Shortest paths in intersection graphs of unit disks
Computational Geometry, 2015 An alternative approach for the unweighted case is added to the ...
Sergio Cabello, Miha Jejčič
openaire +3 more sources
Arthritis Care &Research, EarlyView.Objective Metabolic syndrome (MetS) is a known comorbidity of psoriatic arthritis (PsA) and is associated with PsA disease activity. We aimed to explore the association between MetS and radiographic features (peripheral and axial) in PsA. Methods We included patients with PsA followed at our prospective observational cohort for the period between 1978 ...
Fadi Kharouf +6 more
wiley +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
Advanced Engineering Materials, EarlyView.This article presents the development of Fe‐Mn‐Zn nanocrystalline alloys (0–9 wt% Zn) by mechanical alloying and subsequently hot pressing. Their microstructure, density, hardness, wear resistance, corrosion behavior, and antibacterial properties are systematically examined.
Ilker Emin Dag +3 more
wiley +1 more source
A PTAS for the minimum dominating set problem in unit disk graphs [PDF]
, 2004 We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs. In contrast to previously known approximation schemes for the minimum dominating set problem on unit disk graphs, our approach does not ...
Hurink, Johann, Nieberg, Tim
core +1 more source
Wearable Haptic Feedback Interfaces for Augmenting Human Touch
Advanced Functional Materials, EarlyView.The wearable haptic feedback interfaces enhance user experience in gaming, social media, biomedical instrumentation, and robotics by generating tactile sensations. This review discusses and categorizes current haptic feedback interfaces into force, thermal, and electrotactile stimulation‐based haptic feedback interfaces, elucidating their current ...
Shubham Patel +3 more
wiley +1 more source
Void Traversal for Guaranteed Delivery in Geometric Routing
, 2005 Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorithms run on planar graphs only.
Nesterenko, Mikhail, Vora, Adnan
core +1 more source
Weak Unit Disk and Interval Representation of Graphs [PDF]
, 2016 We study a variant of intersection representations with unit balls: unit disks in the plane and unit intervals on the line. Given a planar graph and a bipartition of the edges of the graph into near and far edges, the goal is to represent the vertices of the graph by unit-size balls so that the balls for two adjacent vertices intersect if and only if ...
Alam, M. J. +3 more
openaire +3 more sources