1163 search results - page 82 / 233 » Embedding into Bipartite Graphs |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
JCT
2010
13 years 2 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...
SIAMDM
2010
13 years 2 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
CODES
2000
IEEE
14 years 15 days ago
2000
IEEE
This paper describes the functional specification and verification portions of El Greco, a system for high-level, heterogeneous functional specification, efficient compiled si...
SIROCCO
2008
13 years 9 months ago
2008
We study communication in known topology radio networks with the presence of interference constraints. We consider a real-world situation, when a transmission of a node produces an...