882 search results - page 113 / 177 » On the Hardness of Graph Isomorphism |
STOC
2010
ACM
14 years 1 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
GG
2008
Springer
13 years 9 months ago
2008
Springer
The model-driven development of model transformations requires both a technique to model model transformations as well as a means to transform transformation models. Therefore, t...
MST
2010
13 years 3 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...