828 search results - page 47 / 166 » Simplicial Powers of Graphs |
Publication
State-of-the-art techniques for probability sampling of users of online social networks (OSNs) are based on random walks on a single social relation. While powerful, these methods ...
COMBINATORICA
2010
13 years 3 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
FUIN
2006
13 years 8 months ago
2006
We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its...
CCS
2006
ACM
14 years 12 days ago
2006
ACM
In this paper, we position the correct way of using graphical models for enhancing cyber security analysis in enterprise networks. Graphical models can be powerful in representati...
TCS
2008
13 years 8 months ago
2008
This paper presents strategies for improving the known upper and lower bounds for the bandwidth of Hamming graphs (Kn)d and [0, 1]d. Our labeling strategy lowers the upper bound o...