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 50 for “"Graph coloring"”.
-
From Graph Coloring to Receptor Clustering
1. Hued colorings for planar graphs, graphs of higher genus and K4-minor free graphs.;For integers k, r > 0, a (k,r) -coloring of a graph G is a proper coloring of the vertices of G with k colors such that every vertex v of degree d(v) is adjacent to vertices with at least min{lcub}d(v) ,r{rcub} …
-
Graph coloring algorithms on random graphs
<p>"The graph coloring problem, which is to color the vertices of a simple undirected graph with the minimum number of colors such that no adjacent vertices are assigned the same color, arises in a variety of scheduling problems. This dissertation focuses attention on vertex sequential coloring. …
-
A probabilistic perspective on graph coloring
Graph coloring is perhaps the most fundamental, deeply-studied, and well-known area in graph theory, with many of the most basic questions in the field still widely open. Graph coloring questions often have wide ranging applications across fields as diverse as statistical physics, theoretical …
-
Problems in Graph Coloring and Graph Structure
… set in the plane, and let G be the intersection graph of F . We studied the chromatic number of the complement of G. We also studied the transversal number of F , where the transversal number is the minimum size of a set of points that intersects all convex sets in F .
-
Speeding up stochastic block partitioning with graph coloring
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2025-05-01
-
Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring
… multiple zombies and/or humans. Conflict-free graph coloring. A conflict-free k-coloring of a graph assigns one of k different colors to some of the vertices such that, for every vertex v, there is a color that is assigned to exactly one vertex among v and v's neighbors. We study the natural …
-
On the Automated Layout of Multi-Layer Planar Wiring and a Related Graph Coloring Problem
Made available in DSpace on 2014-12-10T20:13:31Z (GMT). No. of bitstreams: 1 7219783.pdf: 5320809 bytes, checksum: fa3c4c87e1c22ce349783cb7f042e6ad (MD5) Previous issue date: 1972
-
The difficulty of approximating the chromatic number for random composite graphs
… Traveling Salesman Problem (TSP) and Composite Graph Coloring Problem (CGCP). Unfortunately, both of these problems are ��P-complete and it is not known if efficient algorithms exist to solve these problems. Even approximation with guaranteed results can be just as difficult. Recently, many …
-
ΧΕΙΡΟΤΕΡΗ ΚΑΙ ΜΕΣΗ ΣΥΜΠΕΡΙΦΟΡΑ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΓΙΑ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ
… ALGORITHMS ARE DEVELOPEDFOR MANY IMPORTANT GRAPH PROBLEMS WHICH IMPROVE SIGNIFICANTLY THE COMPLEXITIESOF THE BEST PREVIOUS KNOWN PARALLEL ALGORITHMS ON THE SAME PROBLEMS. MORE PRECISELY WE INVESTIGATE, (I) THE WORST-CASE PARALLEL COMPLEXITY MOSTLY OF COLORINGAND SHORTEST PATH PROBLEMS IN …
-
Linear-time algorithms for graphs with bounded branchwidth
… algorithms to solve several NP-complete graph problems (i.e., INDEPENDENT SET, M AXIMUM CUT, GRAPH COLORING, HAMILTONIAN CYCLE, and DISJOINT PATHS). The linearity is achieved assuming the provision of a branch decomposition of the instance graph. We then modify the framework to create a …
-
The combinatorics of adinkras
Adinkras are graphical tools created to study representations of supersymmetry algebras. Besides having inherent interest for physicists, the study of adinkras has already shown nontrivial connections with coding theory and Clifford algebras. Furthermore, adinkras offer many easy-to-state and …
-
GPU-accelerated Inference for Discrete Probabilistic Programs
… We make two key contributions : (1) a factor graph IR implemented in JAX that supports variable elimination and Gibbs sampling, and (2) a modeling DSL with a compiler that lowers programs to the factor graph IR. Our system enables significant performance optimizations through static analysis …
-
New methods for branch-and-bound algorithms
… the pricing problem in a B&P algorithm for the graph coloring problem. The last method described in this dissertation restructures the search tree in a B&P setting using a wide branching strategy so as to minimize the number of times the constrained pricing problem must be solved. This …
-
The Four Color Theorem: A Possible New Approach
… goal of this thesis is to explore the topic of graph coloring and expand on existing ideas in the field of Graph Theory. These developments will then be used to provide a possible approach in proving the 4 – color theorem that was made famous by Guthrie in the 1800’s.</p> <p>Since the theorem …
-
Extremal problems involving forbidden subgraphs
… study extremal problems involving forbidden subgraphs. We are interested in extremal problems over a family of graphs or over a family of hypergraphs. In Chapter 2, we consider improper coloring of graphs without short cycles. We find how sparse an improperly critical graph can be when it has no …
-
Properties and Recent Applications in Spectral Graph Theory
… of mathematics, specifically spectral graph theory, within the sciences and many other fields. This paper is an exploration of recent applications of spectral graph theory, including the fields of chemistry, biology, and graph coloring. Topics such as the isomers of alkanes, the …
-
An Introduction to List Colorings of Graphs
One of the most popular and useful areas of graph theory is graph colorings. A graph coloring is an assignment of integers to the vertices of a graph so that no two adjacent vertices are assigned the same integer. This problem frequently arises in scheduling and channel assignment applications. A …
-
Functional compression : theory and application
… in terms of the properties of the characteristic graph; this led to a particular coding scheme. We extend that result by providing an achievability scheme that is based on the coloring of the characteristic graph. This suggests a layered architecture where the functional layer controls the …
Page 1 of 3