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 285 for “"Strongly Connected"”.

  1. Automorphism Groups and Quotients of Strongly Connected Automata and Monadic Algebras

    Made available in DSpace on 2014-12-09T22:17:29Z (GMT). No. of bitstreams: 1 6612289.pdf: 2156947 bytes, checksum: 7ec255a282e65238287517c49612b88c (MD5) Previous issue date: 1966

    uiuc Repository record for Automorphism Groups and Quotients of Strongly Connected Automata and Monadic Algebras (opens in a new tab)

  2. On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences

    A strongly connected component of a directed graph G is a maximal subgraph H of G such that for each pair of vertices u and v in H, there is a directed path from u to v and a directed path from v to u in H. A strongly connected component is said to be giant if it has linear size. We determine the …

    waterloo Repository record for On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences (opens in a new tab)

  3. Distributed and Optimal State Estimation for Heterogeneous Dynamic Systems Operating Within a Strongly Connected Network

    … Additionally, the nodes are assumed to be connected through a dynamically changing communication network modeled as a sequence of strongly connected digraphs allowing for local communication and distributed interactions. Using the data sharing afforded by the communication network, a …

    ucf Repository record for Distributed and Optimal State Estimation for Heterogeneous Dynamic Systems Operating Within a Strongly Connected Network (opens in a new tab)

  4. Scaling limist of critical directed graphs

    The scaling limit of connected components in critical undirected random graphs has been well studied and shown to be universal between different critical models of undirected random graphs. Work by Goldschmidt and Stephenson has established the scaling limit of a the strongly connected components …

    oxford Repository record for Scaling limist of critical directed graphs (opens in a new tab)

  5. On the classification of cyclic dependencies in Java programs : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University, Manawatū, New Zealand

    … cyclic dependencies correspond to the concept of strongly connected components in graph theory. We propose an approach to classify strongly connected components according to their topologies. This allows us to distinguish between dense and sparse, symmetric and asymmetric structures. We extend on …

    massey Repository record for On the classification of cyclic dependencies in Java programs : a thesis presented in partial fulfilment of the requirements for the degree of Master of Science in Computer Science at Massey University, Manawatū, New Zealand (opens in a new tab)

  6. Distributed Algorithms for Solving Linear Algebraic Equations & Convex Optimization Problems

    … underlying communication network is fixed and strongly connected, and $A$ has full column rank. Then, we consider the case where each agent is equipped with a private differentiable convex cost function. The goal of the agents is to collaboratively find the optimum of the sum of all local costs …

    queens Repository record for Distributed Algorithms for Solving Linear Algebraic Equations & Convex Optimization Problems (opens in a new tab)

  7. A Hopi House Design Guideline: Incorporating Culture into the Design

    … One world is the Hopi and Tewa lifestyle that is strongly connected to the culture. The other world is the Western lifestyle with modern conveniences that many Hopi and Tewa members have grown accustomed to. These two worlds are split within the modern Hopi housing which results in split living. …

    hawaii Repository record for A Hopi House Design Guideline: Incorporating Culture into the Design (opens in a new tab)

  8. Algorithm design and engineering for graph connectivity problems

    … number of edges whose deletion leaves G not strongly connected. A graph G is strongly connected if there is a directed path from each vertex to any other vertex. Computing the edge connectivity of a graph is a classical subject in graph theory, and is an important notion in several …

    greece Repository record for Algorithm design and engineering for graph connectivity problems (opens in a new tab)

  9. Termination and storage requirements in a model for parallel computations

    … procedure for testing termination properties of strongly connected graphs is presented. A method due to Reiter, for determining the maximum storage required for a computation graph, is extended to cover the general case.

    ubc Repository record for Termination and storage requirements in a model for parallel computations (opens in a new tab) Download PDF for Termination and storage requirements in a model for parallel computations (opens in a new tab)

  10. A convex solution to receding horizon control of switched linear systems

    … switched linear systems subject to a strongly connected switching constraint is exactly solved for finite-path-dependent controllers with finite horizon knowledge of future switching modes. Conditions for the existence of both a full-information state-feedback controller and a dynamic …

    uiuc Repository record for A convex solution to receding horizon control of switched linear systems (opens in a new tab)

  11. Hausdorff, Packing and Capacity Dimensions

    … construction and show that if the graph is strongly connected, then the a—Hausdorff measure is positive and finite. Similar results will be shown for the packing dimension and the packing measure. When the graph is strongly connected, there is a constant so that the constant times the …

    unt Repository record for Hausdorff, Packing and Capacity Dimensions (opens in a new tab)

  12. Evolutionary trade-offs shape structure and dynamics in Boolean gene regulatory networks

    … by the presence of dense, highly interconnected node clusters. A recent, more rigorous definition of modularity identifies the strongly connected components of the wiring diagram as modules. To investigate whether this type of modularity emerges through evolution in molecular systems, I …

    iastate Repository record for Evolutionary trade-offs shape structure and dynamics in Boolean gene regulatory networks (opens in a new tab)

  13. Towards Dynamic Network Analysis: Benchmarks, Applications and Algorithms

    … graph properties such as shortest paths, and strongly connected components, demanding computational methods that can efficiently adapt to these changes at scale. At the same time, the growing scale and diversity of dynamic networks introduces additional demands: the research community needs …

    unt Repository record for Towards Dynamic Network Analysis: Benchmarks, Applications and Algorithms (opens in a new tab)

  14. Derecho, desarrollo y extractivismo : la disputa por el oro en Colombia en un contexto de colonialidad global

    … which the global order and the local order are strongly connected. Secondly, the author analyses how this process has made possible that the extractive paradigm reproduces colonial legacies through new legal mechanisms, which in turn make that the Colombian State reinserts itself permanently in …

    rosario Repository record for Derecho, desarrollo y extractivismo : la disputa por el oro en Colombia en un contexto de colonialidad global (opens in a new tab)

  15. Virtual backbone formation in wireless ad hoc networks

    … way to construct this backbone is by finding a Connected Dominating Set (CDS) in G , which is a subset V' ✹ V such that for every node u, u is either in V' or has a neighbor in V' and the subgraph induced by V' is connected. In a wireless ad hoc network with asymmetric links represented by a …

    concordia Download PDF for Virtual backbone formation in wireless ad hoc networks (opens in a new tab)

  16. On Competition for Undergraduate Co-op Placement: A Graph Approach

    … forming clusters or communities, nodes that are connected to few or many clusters, and nodes that are strongly connected to their immediate neighbours. As we will show, these properties have natural interpretations in terms of the relationships among academic programs and competition for co-op …

    waterloo Repository record for On Competition for Undergraduate Co-op Placement: A Graph Approach (opens in a new tab)

  17. An investigation of arts based pedagogies for democratic participation in early childhood

    … learning. Arts-based pedagogies have been strongly connected to democratic participation in schooling, however little research is available about how these are enacted with young children and families. This thesis addresses these concerns by investigating artist/educator perspectives and …

    adelaide Repository record for An investigation of arts based pedagogies for democratic participation in early childhood (opens in a new tab)

  18. The function and thematic significance of french quotations in charlotte brontë’s novel "jane eyre" /

    … characters and complements the context, which is strongly connected with the author’s own experiences and passions, knowing that French was an important language to her. This analysis will also provide insights into how characters use the language to represent their development, culture, …

    vilnius Repository record for The function and thematic significance of french quotations in charlotte brontë’s novel "jane eyre" / (opens in a new tab)

  19. Intersection graphs, fraternally orientable graphs and hamiltonian cycles.

    … an algorithm to find a hamiltonian cycle in strongly connected fraternally oriented graphs $\vec G$.

    ottawa-retro Repository record for Intersection graphs, fraternally orientable graphs and hamiltonian cycles. (opens in a new tab)

Page 1 of 15