524 search results - page 39 / 105 » On the Maximum Number of Cliques in a Graph |
184
click to vote
SIAMDM
2010
15 years 25 days 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...
151
click to vote
MSN
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. We present a simple and efficient distributed method for determining the transmission power assignment that maximises the lifetime of a data-gathering wireless sensor net...
144
click to vote
INFOCOM
2008
IEEE
16 years 15 days ago
2008
IEEE
—It is important in communication networks to use routes that are as short as possible (i.e have low stretch) while keeping routing tables small. Recent advances in compact routi...
160
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
156
click to vote
DAM
2010
15 years 6 months ago
2010
An equivalence graph is a disjoint union of cliques, and the equivalence number eq(G) of a graph G is the minimum number of equivalence subgraphs needed to cover the edges of G. W...