Results 111 to 120 of about 351 (173)

The min-max edge q-coloring problem

open access: yes, 2013
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q.
Tommi Larjomaa, Alexandru Popa
core  

All-to-all reconfigurability with sparse and higher-order Ising machines. [PDF]

open access: yesNat Commun
Nikhar S   +4 more
europepmc   +1 more source

Joint Poisson Convergence of Monochromatic Hyperedges in Multiplex Hypergraphs

open access: yes
Given a sequence of $r$-uniform hypergraphs $H_n$, denote by $T(H_n)$ the number of monochromatic hyperedges when the vertices of $H_n$ are colored uniformly at random with $c = c_n$ colors. In this paper, we study the joint distribution of monochromatic
Bhattacharya, Bhaswar B., Xie, Yangxinyu
core  

A lower bound for set-coloring Ramsey numbers. [PDF]

open access: yesRandom Struct Algorithms
Aragão L   +4 more
europepmc   +1 more source

New Tools and Connections for Exponential-Time Approximation. [PDF]

open access: yesAlgorithmica, 2019
Bansal N   +4 more
europepmc   +1 more source

Home - About - Disclaimer - Privacy