6,658 research outputs found

    On the Number of Synchronizing Colorings of Digraphs

    Full text link
    We deal with kk-out-regular directed multigraphs with loops (called simply \emph{digraphs}). The edges of such a digraph can be colored by elements of some fixed kk-element set in such a way that outgoing edges of every vertex have different colors. Such a coloring corresponds naturally to an automaton. The road coloring theorem states that every primitive digraph has a synchronizing coloring. In the present paper we study how many synchronizing colorings can exist for a digraph with nn vertices. We performed an extensive experimental investigation of digraphs with small number of vertices. This was done by using our dedicated algorithm exhaustively enumerating all small digraphs. We also present a series of digraphs whose fraction of synchronizing colorings is equal to 11/kd1-1/k^d, for every d1d \ge 1 and the number of vertices large enough. On the basis of our results we state several conjectures and open problems. In particular, we conjecture that 11/k1-1/k is the smallest possible fraction of synchronizing colorings, except for a single exceptional example on 6 vertices for k=2k=2.Comment: CIAA 2015. The final publication is available at http://link.springer.com/chapter/10.1007/978-3-319-22360-5_1

    Improving bounds on large instances of graph coloring

    Get PDF
    This thesis explores new methods, using both vertex cover and exact graph coloring algorithms in addition to our implementation of the state of the art, to develop a hybrid algorithm that on most instances is able to tighten the bounds or determine the optimal number of colors outright

    Coloring Fast with Broadcasts

    Full text link
    We present an O(log3logn)O(\log^3\log n)-round distributed algorithm for the (Δ+1)(\Delta+1)-coloring problem, where each node broadcasts only one O(logn)O(\log n)-bit message per round to its neighbors. Previously, the best such broadcast-based algorithm required O(logn)O(\log n) rounds. If ΔΩ(log3n)\Delta \in \Omega(\log^{3} n), our algorithm runs in O(logn)O(\log^* n) rounds. Our algorithm's round complexity matches state-of-the-art in the much more powerful CONGEST model [Halld\'orsson et al., STOC'21 & PODC'22], where each node sends one different message to each of its neighbors, thus sending up to Θ(nlogn)\Theta(n\log n) bits per round. This is the best complexity known, even if message sizes are unbounded. Our algorithm is simple enough to be implemented in even weaker models: we can achieve the same O(log3logn)O(\log^3\log n) round complexity if each node reads its received messages in a streaming fashion, using only O(log3n)O(\log^3 n)-bit memory. Therefore, we hope that our algorithm opens the road for adopting the recent exciting progress on sublogarithmic-time distributed (Δ+1)(\Delta+1)-coloring algorithms in a wider range of (theoretical or practical) settings.Comment: 42 pages. To appear in proceedings of SPAA 202

    List coloring in the absence of a linear forest.

    Get PDF
    The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The Listk-Coloring problem requires in addition that every vertex u must receive a color from some given set L(u)⊆{1,…,k}. Let Pn denote the path on n vertices, and G+H and rH the disjoint union of two graphs G and H and r copies of H, respectively. For any two fixed integers k and r, we show that Listk-Coloring can be solved in polynomial time for graphs with no induced rP1+P5, hereby extending the result of Hoàng, Kamiński, Lozin, Sawada and Shu for graphs with no induced P5. Our result is tight; we prove that for any graph H that is a supergraph of P1+P5 with at least 5 edges, already List 5-Coloring is NP-complete for graphs with no induced H

    Message passing for the coloring problem: Gallager meets Alon and Kahale

    Full text link
    Message passing algorithms are popular in many combinatorial optimization problems. For example, experimental results show that {\em survey propagation} (a certain message passing algorithm) is effective in finding proper kk-colorings of random graphs in the near-threshold regime. In 1962 Gallager introduced the concept of Low Density Parity Check (LDPC) codes, and suggested a simple decoding algorithm based on message passing. In 1994 Alon and Kahale exhibited a coloring algorithm and proved its usefulness for finding a kk-coloring of graphs drawn from a certain planted-solution distribution over kk-colorable graphs. In this work we show an interpretation of Alon and Kahale's coloring algorithm in light of Gallager's decoding algorithm, thus showing a connection between the two problems - coloring and decoding. This also provides a rigorous evidence for the usefulness of the message passing paradigm for the graph coloring problem. Our techniques can be applied to several other combinatorial optimization problems and networking-related issues.Comment: 11 page
    corecore