34 search results - page 4 / 7 » On the Extension of Bipartite to Parity Graphs |
SPIN
2010
Springer
13 years 5 months ago
2010
Springer
Pushdown systems provide a natural model of software with recursive procedure calls. We provide a tool implementing an algorithm for computing the winning regions of a pushdown par...
FCT
2005
Springer
14 years 28 days 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 ...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined...
TIT
2011
13 years 2 months ago
2011
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
COLOGNETWENTE
2010
13 years 4 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...