NDLTD logo NDLTD Union Catalog and Global ETD Search

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 34 for “"Digraph"”.

  1. Intersection representations of graphs and digraphs

    Lin, In-JenUniversity of Illinois at Urbana-Champaign2011

    A digraph is an interval digraph if each vertex can be assigned a source interval and a sink interval on the real line such that there is an edge from u to v if and only if the source interval for u intersects the sink interval for v. A digraph is an indifference digraph or unit interval digraph if …

    uiuc Repository record

  2. Extremal problems for labelling of graphs and distance in digraphs

    Jahanbekam, SogolUniversity of Illinois at Urbana-Champaign2013

    … in graph labelling and in weak diameter of digraphs. In Chapter 2 we apply the Discharging Method to prove the 1,2,3-Conjecture [41] and the 1,2-Conjecture [48] for graphs with maximum average degree less than 8/3. Stronger results on these conjectures have been proved, but this is the first …

    uiuc Repository record

  3. D-colorable digraphs with large girth

    Rafferty, Liam

    … <italic>The circular chromatic number of a digraph</italic>, J. Graph Theory <bold>46</bold> (2004), 227-240; B. Bollobas and N. Sauer, <italic>Uniquely colourable graphs with large girth</italic>, Canad. J. Math. <bold>28</bold> (1976), 1340-1344; J. Nesetril and X. Zhu, <italic>On sparse …

    montana-tech Repository record

  4. D-colorable digraphs with large girth

    Rafferty, Liam

    … <italic>The circular chromatic number of a digraph</italic>, J. Graph Theory <bold>46</bold> (2004), 227-240; B. Bollobas and N. Sauer, <italic>Uniquely colourable graphs with large girth</italic>, Canad. J. Math. <bold>28</bold> (1976), 1340-1344; J. Nesetril and X. Zhu, <italic>On sparse …

    montana Repository record

  5. Qualitative Reasoning Methodology for the Generation of Process Plant Operating Procedures

    Vianna, Regina FerreiraUniversity of Leeds1995

    … a qualitative reasoning methodology, weighted digraph (WDG) approach, for describing the dynamics of complex chemical processes, and in particular of distributed parameter systems, with a considerable reduction in the generation of spurious solutions. It is based on a generalisation of the …

    whiterose Repository record

  6. ΤΕΧΝΙΚΕΣ ΣΧΕΔΙΑΣΜΟΥ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΚΑΙ Η ΕΦΑΡΜΟΓΗ ΤΟΥΣ ΣΕ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ

    Πάντζιου, ΓραμματήΠανεπιστήμιο Πατρών1991

    … TECHNIQUE BASED ON THE DECOMPOSITION OF A PLANAR DIGRAPH INTO SPECIAL OUTERPLANAR SUBGRAPHS CALLED HAMMOCKS. 2. WE PRESENT A PROBABILISTIC TECHNIQUE FOR FINDING PARALLEL APPROXIMATION SOLUTIONS FOR NP-HARD PROBLEMS.3. NEW "ADAPTIVE" PROBABILISTIC TECHNIQUES ARE PRESENTED FOR THE AVERAGE-CASE …

    greece Repository record

  7. Controllability and Observability of a Large Scale Thermodynamical System via Connectability Approach

    Permana, Virdiansyah2001

    … condition. The graph theory of a directed graph (digraph) is utilized to model the system, and the rule of its adaptation in nonlinear class is defined. Subsequently, necessary and sufficient terms to achieve controllability and observability condition are investigated through the structural …

    denver Repository record

  8. Embedding problems in graphs and hypergraphs

    Treglown, Andrew ClarkUniversity of Birmingham2011

    … We give a condition on the degree sequences of a digraph \(G\) that ensures \(G\) is Hamiltonian. This gives an approximate solution to a problem of Nash-Williams concerning a digraph analogue of Chvatal's theorem. We also show that every sufficiently large regular tournament can almost completely …

    birmingham Repository record

  9. Jungčių prognozavimas, paremtas orientuoto tinklo klasterizacijos koeficientu /

    Verseckas, Žilvinas,Institutional Repository of Vilnius University2019

    … link prediction methods based on a concept of digraph clustering coefficient proposed by M. Bloznelis and L. Leskelä. The goal of this research is to define new link prediction indices derived from the clustering coefficient mentioned above. We also aim to empirically evaluate the performance …

    vilnius Repository record

  10. Decompositions, Packings, and Coverings of Complete Directed Gaphs with a 3-Circuit and a Pendent Arc.

    Gwellem, Chrys2007

    … packings, and coverings of the complete digraph with the two 3-circuit with a pendant arc orientations.</p>

    etsu Repository record

  11. Decomposition, Packings and Coverings of Complete Digraphs with a Transitive-Triple and a Pendant Arc.

    Lewenczuk, Janice Gail2007

    … packings and coverings of the complete digraph with each of the six transitive triples with a pendant arc.</p>

    etsu Repository record

  12. Packings and Coverings of Various Complete Digraphs with the Orientations of a 4-Cycle.

    Cooper, Melody Elaine2007

    … are given for covering complete directed digraphs <em>D<sub>v</sub></em>, packing and covering complete bipartite digraphs, <em>D<sub>m,n</sub></em>, and packing and covering the complete digraph on <em>v</em> vertices with hole of size <em>w</em>, <em>D</em>(<em>v</em>,<em>w</em>), with …

    etsu Repository record

  13. A systemic exploration of information systems project risks in the South African public sector

    Chiloane, Poelo LeoDepartment of Construction Economics and Management2021

    … an Interpretive Structural Modelling (ISM) digraph with the aid of software. The ISM digraph revealed three risk factors as the primary drivers of IS project risks in the public sector, specifically, in the context of this study. These risks are ‘lack of consultation with users', ‘budget …

    cape-town Repository record

  14. Ádám's Conjecture and Arc Reversal Problems

    Salas, Claudio D2016

    <p>A. Ádám conjectured that for any non-acyclic digraph <em>D</em>, there exists an arc whose reversal reduces the total number of cycles in <em>D</em>. In this thesis we characterize and identify structure common to all digraphs for which Ádám's conjecture holds. We investigate quasi-acyclic …

    csusb Repository record

  15. On stability and controllability of conjunctive Boolean networks

    Gao, ZuguangUniversity of Illinois at Urbana-Champaign2017

    … orbit to another. In particular, we construct a digraph, with the vertices being the periodic orbits, and the (directed) edges representing the transitions among the orbits. We call such a digraph the stability structure of the CBN. We then investigate the orbit-controllability and …

    uiuc Repository record

  16. Kinematics of the fingers during typing

    Long, Manda MarieVirginia Tech1994

    … <i>Row</i> (Upper, Middle, and Lower), and <i>Digraph</i> (typing two letters with the same finger, with two fingers on the same hand, or with two opposite hands). The results indicated that for all four dependent measures, there was a significant difference between all three levels of …

    vt Repository record

  17. Tie Inducement using Closure Analysis in Information Networks

    Munimadugu, HareendraUniversity of Cincinnati2012

    … Social network, Information network, digraph, Closure Analysis, Connections, Influential node, network structure</p>

    ohiolink Repository record

  18. Chain Routing: A novel routing framework for increasing resilience and stability in the Internet

    Arjona Villicaña, Pedro DavidUniversity of Birmingham2010

    … represented as a graph, are the most connected digraph that does not contain any cycles. Consequently, a complete order could be applied to route information from a source to a destination with the guarantee that cycles will not develop in a path. A second numerical analysis demonstrates the …

    birmingham Repository record

  19. Isotropy criteria and algorithms for data clustering

    Shetty, Sanketh V.University of Illinois at Urbana-Champaign2011

    … several algorithms for the analysis of this digraph to produce clusters. They range from a simple directed-tree approach to sophisticated spectral analysis of the digraph. We evaluate these algorithms on challenging real datasets and compare their performance against popular and classic …

    uiuc Repository record

  20. Dynamic Data Structures for Two Dimensional Searching

    Tamassia, RobertoUniversity of Illinois at Urbana-Champaign2014

    … transitive closure, considers a planar acyclic digraph embedded in the plane, and asks for testing the existence of and/or reporting a directed path between two query vertices. In all of the three problems the update operations consist of inserting/deleting vertices and edges. We present several …

    uiuc Repository record

Page 1 of 2