Sciweavers

524 search results - page 27 / 105
» On the Maximum Number of Cliques in a Graph
Sort
View
ENDM
2006
119views more  ENDM 2006»
13 years 7 months ago
The incidence game chromatic number
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
Stephan Dominique Andres
ORL
2008
115views more  ORL 2008»
13 years 7 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama
SIAMCOMP
2002
139views more  SIAMCOMP 2002»
13 years 7 months ago
Approximating the Domatic Number
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
Uriel Feige, Magnús M. Halldórsson, ...
CONEXT
2009
ACM
13 years 8 months ago
StarClique: guaranteeing user privacy in social networks against intersection attacks
Building on the popularity of online social networks (OSNs) such as Facebook, social content-sharing applications allow users to form communities around shared interests. Millions...
Krishna P. N. Puttaswamy, Alessandra Sala, Ben Y. ...
FCS
2009
13 years 5 months ago
The Importance of Symmetric Representation
- A representation for a set is defined to be symmetric if the space required for the representation of the set is the same as the space required for representation of the set'...
Thomas O'Neil