1208 search results - page 90 / 242 » On Counting Generalized Colorings |
FCT
2005
Springer
14 years 2 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
PODC
2010
ACM
14 years 1 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
JCT
2011
13 years 4 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
EJC
2008
13 years 9 months ago
2008
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
POPL
2005
ACM
14 years 9 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...