Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 25 for “"Disk graphs"”.
-
Generalised disk graphs
Generalized Disk Graphs were introduced as a faithful abstraction of wireless interference. In this paper we show how these graphs can be represented geometrically in all dimensions and then use this geometric representation to characterize the graphs and find forbidden subgraphs. We find that in …
-
Algorithmic aspects of constrained unit disk graphs
Computational problems on graphs often arise in two- or three-dimensional geometric contexts. Such problems include assigning channels to radio transmitters (graph colouring), physically routing traces on a printed circuit board (graph drawing), and modelling molecules. It is reasonable to expect …
-
Algorithms for Unit-Disk Graphs and Related Problems
… we study algorithms for several problems on unit-disk graphs and related problems. The unit-disk graph can be viewed as an intersection graph of a set of congruent disks. Unit-disk graphs have been extensively studied due to many of their applications, e.g., modeling the topology of wireless …
-
Improper colourings of graphs
… a generalisation of proper vertex colouring of graphs, referred to as improper colouring, in which each vertex can only be adjacent to a bounded number t of vertices with the same colour, and we study this type of graph colouring problem in several different settings. The thesis is divided into …
-
Geometric Graphs: Reachability, Long Trees and Short Cycles
… distance between s and t. One such class of graphs are spanning trees of the point set. That is, an acyclic graph defined on S such that all sites lie in the same connected component. To define the second broad class of geometric graphs considered in this thesis, we extend each site with a …
-
Minimum Latency Aggregation Convergecast in Wireless Sensor Networks
… has been proven to be NP-Complete even for unit disk graphs. We present a new simpler proof of the NP-Completeness of the MLAS Problem for arbitrary networks and unit disk graphs. We give tight bounds for the latency of aggregation convergecast for grids, tori, and trees. For regular unit …
-
Disk Intersection Graphs: Models, Data Structures, and Algorithms
… be a set of n point sites in the plane. The unit disk graph UD(P) on P has vertex set P and an edge between two sites p,q of P if and only if p and q have Euclidean distance |pq| <= 1. If we interpret P as centers of disks with diameter 1, then UD(P) is the intersection graph of these disks, i.e., …
-
Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network
… that guarantees delivery in connected unit disk graphs (where two nodes are connected if and only if their distance is no more than the transmission radius, which is equal for all nodes). The FACE mode is a recovery mode used when no neighbor closer to destination exists. FACE mode requires …
-
Optimization in Geometric Graphs: Complexity and Approximation
… several related problems arising in geometric graphs. In particular, we investigate the computational complexity and approximability properties of several optimization problems in unit ball graphs and develop algorithms to find exact and approximate solutions. In addition, we establish …
-
Shortest Paths in Geometric Intersection Graphs
… studies shortest paths in geometric intersection graphs, which can model, among others, ad-hoc communication and transportation networks. First, we consider two classical problems in the field of algorithms, namely Single-Source Shortest Paths (SSSP) and All-Pairs Shortest Paths (APSP). In SSSP we …
-
Maximum Clique in Geometric Intersection Graphs
… maximum clique in various geometric intersection graphs. We develop three results motivated by the maximum clique problem in the intersection graph of disks in the Euclidean plane. First, we improve the time complexity of calculating the maximum clique in unit disk graphs from O(n3 log n) to …
-
Randomized routing algorithms in mobile ad hoc networks
… with probability 1. Our experiments on unit disk graphs, and their associated Yao graphs, Gabriel graphs, and Planarized Local Delaunay Triangulations, show that the delivery rates of all the randomized algorithms we study are significantly better than the deterministic greedy and directional …
-
Localized criteria for detection of critical nodes and links and k-connectivity in ad hoc networks
… two ways of uniform generation of connected unit disk graphs. They show low percentage of false 'alarms', ability to locate critical areas in k-disconnected networks, and increased accuracy with increased local knowledge.
-
Optimization problems in network mechanism design
… network. We mainly study the classes of planar graphs and trees which model air and water pollution and design truthful approximate mechanisms. In Chapter 3 we introduce a new mechanism design model for a new model for the budgeted maximum lifetime coverage (BMLC) in wireless sensor networks …
-
Mathematical Foundations and Algorithms for Clique Relaxations in Networks
… s-plex, k-core, quasi-clique, and k-connected subgraphs. Since cliques have found applications in so many fields, research into these clique relaxations has the potential to steer the course of much future research. The focus of this dissertation is on bringing organization and rigorous …
-
Connectivity Constraints in Network Analysis
… a full description of CSP for a wide class of graphs, including forest and several types of dense graphs, such as graphs with small independence number, s-plex with small s and s-defective cliques with small s. Furthermore, we investigate the relationship between lifting techniques, maximum …
-
Efficient Data Dissemination in Wireless Ad Hoc Networks
… algorithms to construct a D(2,k,r) in unit disk graphs and in general graphs. We also derive upper bounds on the total (k,r)-domination number in graphs of girth at least 2k+1 as well as in random graphs with non-fixed probability p. In mobile ad hoc networks we propose a hexagonal based …
-
Characterizing and Detecting Cohesive Subgroups with Applications to Social and Brain Networks
… and interactions are commonly represented using graphs due to several advantages. This dissertation focuses on developing theory and algorithms for novel methods in graph theory and optimization, and their applications to social and brain networks. Specifically, the major contributions of this …
Page 1 of 2