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 10 of 10 for “"Vertex Coloring"”.
-
Graph Theory for the Secondary School Classroom.
… developed four units in Graph Theory, namely Vertex Coloring, Minimum Spanning Tree, Domination, and Hamiltonian Paths and Cycles, which are appropriate for high school level.</p>
-
Parallel algorithms for scheduling data-graph computations
… atomically modifies the data associated with a vertex as a function of the vertex's prior data and that of adjacent vertices. A dynamic data-graph computation updates only an active subset of the vertices during a round, and those updates determine the set of active vertices for the next round. …
-
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 …
-
Chromatic scheduling of dynamic data-graph computations
… alternative is chromatic scheduling which uses a vertex coloring of the conflict graph to divide data-graph updates into sets which may be parallelized without races. To date, however, only static data-graph computations, which do not schedule updates at runtime, have employed chromatic …
-
Scalable and Efficient Graph Algorithms and Analysis Techniques for Modern Machines
… high probability, dynamic algorithm for (Δ+1)-vertex coloring. Then, we provide a new parallel level data structure for the k-core decomposition problem under batch-dynamic updates (where dynamic edge updates are applied in batches). We show that our data structure provably provides a …
-
Coloring and covering problems on graphs
… conjecture that when $n=3m$ the $K_4$-free $n$-vertex graph maximizing $\pi_f(G)$ is $K_{m,m,m}$. We also consider analogous problems for circular orderings, where pairs of nonincident edges are separated unless their endpoints alternate. Let $\pi^\circ(G)$ be the number of circular orderings …
-
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
-
Games on graphs, visibility representations, and graph colorings
… a graph G assigns a nonnegative integer to each vertex of V(G). An f-matching in G is a set M ⊆ E(G) such that the number of edges of M incident to v is at most f(v) for all v ⊆ V(G). In the f-matching game on a graph G, denoted (G,f), players Max and Min alternately choose edges of G to build an …