Most of you have used a navigation app like Google Maps for your travels at some point. These apps rely on algorithms that compute shortest paths through vast networks. Now imagine scaling that task ...
ABSTRACT: We introduce the bichromatic triangle polynomial P G Δ ( k ) , a chromatic invariant that counts vertex colorings of a graph in which every designated triangular face uses exactly two colors ...
Abstract: The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color. This NP-hard problem has various ...
title: Misra and Gries Edge Coloring Algorithm Let $G$ be a graph with $n$ vertices and $m$ edges with maximum degree $\Delta$. Then there is an algorithm that ...
Graph theory is an integral component of algorithm design that underlies sparse matrices, relational databases, and networks. Improving the performance of graph algorithms has direct implications to ...
Abstract: Coloring for random graph from G(n,1/2) is a classic example exhibiting an Information v. Computation gap: it has chromatic number of Theta(n/log n) w.p. 1-o(1) while the best efficiently ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results