Results 41 to 50 of about 124,717 (298)
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
Isolated singularities of the prescribed mean curvature equation in Minkowski $3$-space [PDF]
, 2017 We give a classification of non-removable isolated singularities for real analytic solutions of the prescribed mean curvature equation in Minkowski $3 ...
Gálvez, José A. +2 more
core +2 more sources
Recognizing Weighted Disk Contact Graphs
, 2015 Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph.
Klemz, Boris +2 more
core +2 more sources
Strongly connected dominating set construction algorithm balancing time delay and energy consumption
Tongxin xuebao, 2012 To the asymmetry of link in wireless sensor networks,a problem about the strongly connected dominating tree with bounded transmission delay (SDTT) was put forward.The distributed strongly connected dominating tree (SCDT) algorithm was also proposed to ...
Yan-jing SUN +3 more
doaj +2 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
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
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
Challenges during Flash Lamp Annealing of Aerosol‐Deposited Barium Titanate Films
Advanced Engineering Materials, EarlyView.Aerosol deposition is used to rapidly deposit barium titanate films with thicknesses ranging from 2 to 16 μm at room temperature, eliminating the need for further densification. However, to recover the electromechanical properties, annealing is required, which limits the usage of temperature‐sensitive substrates.
Michel Kuhfuß +7 more
wiley +1 more source
Good quality virtual realization of unit disk graphs
Journal of Computational Geometry, 2011 We consider the problem of finding a realization of an n-vertex unit disk graph (UDG) expressed in general form, say, as an adjacency matrix. The problem is to construct an embedding of the graph in low-dimensional Euclidean space so that the ratio of ...
Sriram Pemmaraju, Imran Pirwani
doaj +1 more source
Advanced Functional Materials, EarlyView.Biofabrication aims at providing innovative technologies and tools for the fabrication of tissue‐like constructs for tissue engineering and regenerative medicine applications. By integrating multiple biofabrication technologies, such as 3D (bio) printing with fiber fabrication methods, it would be more realistic to reconstruct native tissue's ...
Waseem Kitana +2 more
wiley +1 more source