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 16 of 16 for “"Vertex-Edge"”.

  1. Vertex-Edge and Edge-Vertex Parameters in Graphs

    … focused on either sets of vertices or sets of edges; for example, sets of vertices that dominate all other vertices or sets of edges that dominate all other edges. There has been very little research on ``mixing'' vertices and edges. We investigate several new and several little-studied …

    clemson Repository record for Vertex-Edge and Edge-Vertex Parameters in Graphs (opens in a new tab)

  2. Three-dimensional morphing using computer graphics

    … This algorithm employs both the topology (vertex/edge/face network) and geometry from the original models in establishing vertex, edge, and face correspondences between the models. At conclusion, the two unrelated models have been merged into a common topology that can be used to transform …

    ucf Repository record for Three-dimensional morphing using computer graphics (opens in a new tab)

  3. Scheduling in computer and communication systems and generalized graph coloring problems

    … problems we attack are called bounded max-vertex/edge-coloring problems and take as input a vertex/edge weighted graph and a bound b. In these problems each color class is of cardinality at most b and of weight equal to that of the heaviest vertex/edge in this class. The objective is to …

    greece Repository record for Scheduling in computer and communication systems and generalized graph coloring problems (opens in a new tab)

  4. Gromit An In-Memory Graph Database

    … in property lists of the vertices and edges. Gromit uses a vertex-edge graph model and represent both vertices and edges as entities of the graph. Edges are stored in a doubly linked list manner in main memory. We implement breadth-first traversal and depth-first traversal to retrieve …

    waterloo Repository record for Gromit An In-Memory Graph Database (opens in a new tab)

  5. CONSTRUCTING BINARY ENCODING MATRICES FROM JOINED GRAPHS

    … the construction of binary codes created by vertex-edge incidence matrices of planar graphs. The Hamming (7,4) code was an incredible code that allowed the detection and correction of errors after receiving them through a transmission. We will explore the possibility of the creation of …

    csusb Repository record for CONSTRUCTING BINARY ENCODING MATRICES FROM JOINED GRAPHS (opens in a new tab)

  6. Modeling planar 3-valence meshes

    … allows user to cut a source mesh based on its edges, faces or vertices. The user can sculpt various kinds of developable surfaces by cutting the parallel edges of the mesh. The user can also introduce in- teresting conical patterns by cutting dierent vertex, edge, face combinations of the mesh.

    tamu Repository record for Modeling planar 3-valence meshes (opens in a new tab)

  7. Implicit Real Vector Automata

    … and determining the polyhedron component (vertex, edge, facet, ...) that contains a point. An advantage of IRVA is that they can easily be minimized into a canonical form, which leads to a simple and efficient test for equality between represented polyhedra. Elementary IRVA representing …

    liege Repository record for Implicit Real Vector Automata (opens in a new tab) Download PDF for Implicit Real Vector Automata (opens in a new tab)

  8. Investigation of the robustness of star graph networks

    … It possesses many nice properties, such as vertex/edge symmetry, recursiveness, sublogarithmic degree and diameter, and maximal fault tolerance, which are all desirable when building an interconnection topology for a parallel and distributed system. Investigation of the robustness of the …

    unlv Repository record for Investigation of the robustness of star graph networks (opens in a new tab) Download PDF for Investigation of the robustness of star graph networks (opens in a new tab)

  9. On Token Movement Problems

    … goal is to compute a fixed subset of vertices or edges that minimizes or maximizes some objective function. In addition to unchanging instances, the static model ignores the potential existence of prior (partially feasible) solutions as well as the costs associated with materializing a new (more …

    waterloo Repository record for On Token Movement Problems (opens in a new tab)

  10. Aspects of graph colouring

    … we examine the use of latin squares to represent edge and total colourings. In Chapters 4 - 6 we deal with vertex, edge and total colourings respectively. <br></br><br></br>Various ways of measuring different aspects of graphs are presented, in particular, the ‘colouring difference’ between two …

    the-open-u Download PDF for Aspects of graph colouring (opens in a new tab)

  11. Distinct element modelling of jointed rock masses : algorithms and their verification

    … procedures. They do not rely on conventional vertex-edge-face hierarchical data structures and tedious housekeeping algorithms. The algorithms have been verified against analytical and numerical solutions, as well as validated against experimental results published in the literature. Among …

    oxford Repository record for Distinct element modelling of jointed rock masses : algorithms and their verification (opens in a new tab)

  12. Simultaneous Graph Representation Problems

    … points for vertices and non-crossing curves for edges. An interval graph can be represented on the real line with intervals for vertices and intersection of intervals representing edges. The concept of ``simultaneity'' applies for several types of graphs: the idea is to find representations for …

    waterloo Repository record for Simultaneous Graph Representation Problems (opens in a new tab)

  13. Intrinsic discretization for elliptic boundary value problems

    … of the finite element spaces in a direct sum of vertex-, edge- and triangle-supported subspaces for which basis functions are obtained. We derive weak continuity conditions for the characterization of the admissible energy space. Based on these conditions we derive conforming intrinsic polynomial …

    zurich

  14. Physical computing in primary and secondary education : techniques and tools for teaching and assessment

    … information is extracted using a Gaussian vertex edge histogram kernel. This kernel defines the structural similarity between two abstract syntax trees which can be used to cluster similar programs together. To extract functional information, we executed the programs in a simulated …

    ghent Repository record for Physical computing in primary and secondary education : techniques and tools for teaching and assessment (opens in a new tab)

  15. Grafická reprezentace grafů

    Tato diplomová práce se zabývá zobrazovacími algoritmy grafů známých z matematické teorie. Tyto algoritmy řeší problematiku vhodného rozmístění uzlů grafu tak, aby byl výsledný graf co nejvíce přehledný a čitelný člověkem. Hlavním cílem práce bylo také implementovat vlastní zobrazovací algoritmus v …

    brno-tech Repository record for Grafická reprezentace grafů (opens in a new tab)

  16. Univerzální grafický editor jako knihovna a modul pro Python

    Častým prostředkem pro přehledné zobrazení informací jsou různá schemata, diagramy, souhrně grafy. Používají se často například ve výuce pro prezentaci některých algoritmů a velké využití mají i v technické praxi v podobě UML diagramů, grafů topologie sítě a graf můžeme dokonce pozorovat v …

    brno-tech Repository record for Univerzální grafický editor jako knihovna a modul pro Python (opens in a new tab)