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 10 of 10 for “"Edge addition"”.

  1. A Hybrid Approach to Network Robustness Optimization using Edge Rewiring and Edge Addition

    … methods of accomplishing this task, including edge rewiring and edge addition. Both of these methods can be very useful for optimizing network robustness, but each comes with its own set of limitations. This thesis proposes a new hybrid approach to network robustness optimization that combines …

    brock Repository record for A Hybrid Approach to Network Robustness Optimization using Edge Rewiring and Edge Addition (opens in a new tab)

  2. Edge impact in graphs and social network matrix completion

    … the change in any particular invariant upon addition of a new edge $e$ in the resulting graph G+e. In graphs, the P-impact of an edge e is the `magnitude' of the difference between the values of the invariant P in graphs G+e from G. Several famous invariants are explored and a proof towards …

    msu Repository record for Edge impact in graphs and social network matrix completion (opens in a new tab)

  3. Global Domination Stable Graphs

    … domination number. In particular, we explore edge removal, edge addition, and vertex removal.

    etsu Repository record for Global Domination Stable Graphs (opens in a new tab) Download PDF for Global Domination Stable Graphs (opens in a new tab)

  4. Connectivity Preservation in Distributed Control of Multi-Agent Systems

    … graph, and then extended to the case of dynamic edge addition. Connectivity preservation for problems involving static leaders is covered as well. The potential functions are chosen to be smooth, resulting in bounded control inputs. These functions are subsequently used to develop connectivity …

    concordia Download PDF for Connectivity Preservation in Distributed Control of Multi-Agent Systems (opens in a new tab)

  5. Shell-side transfer in shell-and-tube heat exchangers

    … is the free flow area determined at the baffle edge. Addition of the leakage area to this flow area resulted in correlation of all commercial leakage geometrical parameters. The procedures used to correlate the pressure drop data from a total of eighteen different configurations on a single …

    aston Download PDF for Shell-side transfer in shell-and-tube heat exchangers (opens in a new tab)

  6. Emergent behaviors in adaptive dynamical networks with applications to biological and social systems

    … and compare different rules of competitive edge addition that use topological and dynamical information from the network to determine how new network links are added. We find that aiming to keep connected components small is more effective at preventing widespread network failure than …

    maryland Repository record for Emergent behaviors in adaptive dynamical networks with applications to biological and social systems (opens in a new tab)

  7. On Induced Saturation in Graphs and Tournaments

    … is isomorphic to H — and adding or removing any edge in G leaves a graph that is no longer H-free. In this thesis, we study the following question: For which graphs H does there exist an H-induced-saturated graph G? A full answer remains out of reach; indeed, it remains open whether …

    waterloo Repository record for On Induced Saturation in Graphs and Tournaments (opens in a new tab)

  8. Customer mobility and congestion in supermarkets

    … which the nodes are zones in a supermarket and edges connect adjacent zones. Customers traverse the network from node to node and queue at each node. We measure congestion by the total mean queue size Q (which is equivalent to the total number of customers in a store). We are interested in how …

    oxford Repository record for Customer mobility and congestion in supermarkets (opens in a new tab)

  9. Analyzing The Community Structure Of Web-like Networks: Models And Algorithms

    … random graph models take into account only the addition of new nodes and edges. Yet, several empirical observations indicate that deletion of nodes and edges occurs frequently in web-like networks. Inspired by such observations, we propose and analyze two dynamic random graph models that combine …

    ucf Repository record for Analyzing The Community Structure Of Web-like Networks: Models And Algorithms (opens in a new tab)

  10. Edge modification on perfect and reducible graphs with application to watermarking

    … and a more applied part, both related to edge modification problems on classes of graphs. For the theoretical part, we study and present polynomial algorithms for the minimum completion problem (i) of a graph with a “tail” for four subclasses of perfect graphs and (ii) of a graph and an …

    greece Repository record for Edge modification on perfect and reducible graphs with application to watermarking (opens in a new tab)