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 2326 for “"Vertex"”.
-
The Vertex Algebra Vertex
… thesis reviews some aspects of a large class of vertex operator algebras labelled by $(p,q)$ webs colored by non-negative integers associated to faces of the web diagrams [1,2,3,4]. Such vertex operator algebras conjecturally correspond to two mutually dual setups in gauge theory. First, they …
-
Vertex-Edge and Edge-Vertex Parameters in Graphs
… and several little-studied parameters, including vertex-edge domination, vertex-edge irredundance, vertex-edge independence, edge-vertex domination, edge-vertex irredundance, and edge-vertex independence.
-
Vertex Weighted Spectral Clustering
… number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian …
-
Vertex location for robotics applications
… A high speed algorithm for extracting vertex location is an essential part of the performance of the system. The class of algorithms based on edge detection, small mask vertex extraction and matching line to determine the image coordinates of object surface is considered. The method …
-
Vertex Classification on Weighted Networks
This paper provides a framework for vertex classification on weighted networks. We assume that the edge weights and adjacencies in the network are conditionally independent and that both sources of information encode class membership information. In particular, we introduce a edge weight …
-
GRAPH MATCHING AND VERTEX NOMINATION
… on over-lapping, but possibly non-identical, vertex sets, many inference tasks involve learning the across-network alignment. Often, this task is difficult due to the enormity of the graphs, as network alignment (that is, graph matching) is NP-hard in its most general form. That being said, …
-
Efficient Vertex-Centric Graph Coloring
Graph coloring is a way of labeling (with labels traditionally referred to as “colors”) the elements of a graph with the constraint that no two adjacent vertices have the same color and that as few colors should be used as possible. In addition to many theoretical problems, graph coloring lends …
-
The inhomogeneous six-vertex model
The inhomogeneous six-vertex model is a 2D multiparametric integrable statistical system. In the scaling limit it is expected to cover different classes of critical behaviour, which have remained mostly unexplored. For general values of the parameters and twisted boundary conditions, the model …
-
Graph Convexity and Vertex Orderings
… and classifying graphs for which different vertex ordering algorithms result in a P-elimination ordering, for P the characteristic property of the extreme points of the convexity. We consider the geodesic, monophonic, m3, 3-Steiner and 3-monophonic convexities, and the vertex ordering …
-
Local Structure for Vertex-Minors
… on the structure of graphs with a forbidden vertex-minor; the conjecture is like the Graph Minors Structure Theorem of Robertson and Seymour but for vertex-minors instead of minors. We take a step towards proving the conjecture by determining the "local structure''. Our first main theorem is …
-
Heterogeneous Generalizations of Vertex Coloring
… results in some heterogeneous generalizations of vertex coloring, i.e. generalizations in which the relationship between the colors of two adjacent vertices may differ throughout the graph. For the most part, the results are from group coloring, group list coloring, and DP coloring. The main …
-
The Vertex-Switching Reconstruction Problem
Switching on a vertex of a graph involves swapping the sets of neighbours and non-neighbours of the vertex. The resultant graph is called a switch card of the original graph. The switch deck of a graph is the collection of all of its switch cards. The vertex-switch reconstruction problem then asks …
-
Vertex coloring with forbidden subgraphs
… A $hole$-$twin$ is a graph obtained by adding a vertex adjacent to three consecutive vertices in a $hole$. Hole-twins are closely related to the characterization of the line graphs in terms of forbidden subgraphs. By using {\it clique-width} and {\it perfect graphs} theory, we show that …
-
Classification of Vertex-Transitive Structures
… the Borel complexities of various classes of vertex-transitive structures, or structures for which every pair or elements are equivalent under some element of its automorphism group. John Clemens has shown that the class of vertex-transitive graphs has maximum possible complexity, namely Borel …
-
Vertex Models on Random Graphs
Diese Arbeit befaßt sich mit der Koppelung von Vertex-Modellen an die planaren $\phi^4$-Zufallsgraphen des Zugangs zur Quantengravitation über dynamische Polygonifizierungen. Das betrachtete System hat eine doppelte Bedeutung, einerseits als die Koppelung einer konformen Feldtheorie mit zentraler …
-
Statistical mechanics of vertex cover
Thesis (Ph. D.)--Michigan State University. Department of Physics and Astronomy, 2007
-
Broadcasting in weighted-vertex graphs
… their neighbors. The new model, called weighted-vertex model, comes to have real world applications in parallel computation and satellite terrestrial networks. Broadcasting in weighted-vertex model is a generalized version of classical broadcasting problem, which is NP_Complete. The problem …
-
Vertex Stabilizers for Network Bargaining Games
… with edge weights $w \in \mathbb{R}^E_{+}$ and vertex capacities $c \in \mathbb{Z}^V_+$. A \emph{solution} to an instance $(G, w, c)$ of a network bargaining game is data $(M, z)$, where $M \subset E$ is a $c$-matching, and $z \in \mathbb{R}^{2E}_{\geq 0}$ is a vector which assigns each edge $uv …
Page 1 of 117