Results 31 to 40 of about 89,804 (156)
Reverse Shortest Path Problem for Unit-Disk Graphs [PDF]
, 2021 Given a set P of n points in the plane, the unit-disk graph Gr(P) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q \in P if the Euclidean distance between p and q is at most r (the weight of the edge is 1 in the unweighted case and is the distance between p and q in the weighted case).
Wang, Haitao, Zhao, Yiming
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
Network Localization on Unit Disk Graphs [PDF]
2011 IEEE Global Telecommunications Conference - GLOBECOM 2011, 2011 5 ...
Kaewprapha, Phisan +2 more
openaire +2 more sources
Dominating Set Algorithms for Wireless Sensor Networks Survivability
IEEE Access, 2018 Limited energy of the sensors is one of the key issues towards realizing a reliable wireless sensor network (WSN), which can survive under the emerging WSN applications.
Tayler Pino +2 more
doaj +1 more source
Approximation Algorithms for Unit Disk Graphs [PDF]
, 2005 We consider several graph theoretic problems on unit disk graphs (Maximum Independent Set, Minimum Vertex Cover, and Minimum (Connected) Dominating Set) relevant to mobile ad hoc networks. We propose two new notions: thickness and density. If the thickness of a unit disk graph is bounded, then the mentioned problems can be solved in polynomial time ...
openaire +3 more sources
Heuristics for Network Coding in Wireless Networks [PDF]
, 2007 Multicast is a central challenge for emerging multi-hop wireless architectures such as wireless mesh networks, because of its substantial cost in terms of bandwidth. In this report, we study one specific case of multicast: broadcasting, sending data from
Adjih, Cédric +2 more
core +4 more sources
Bidimensionality and Geometric Graphs
, 2011 In this paper we use several of the key ideas from Bidimensionality to give a new generic approach to design EPTASs and subexponential time parameterized algorithms for problems on classes of graphs which are not minor closed, but instead exhibit a ...
Fomin, Fedor V. +2 more
core +2 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
Comparison of Yield and Quality of Forage in the Intercropping of Rye (Secale cereale L.) and Vetch (Vicia villosa Roth.) under Different Tillage Systems [PDF]
پژوهشهای زراعی ایرانIntroduction Conservation tillage systems are a key component of sustainable agricultural management, significantly contributing to the improvement of soil’s physical, biological, and chemical properties.
T Salavati +3 more
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