721 search results - page 55 / 145 » Bounds on the k-domination number of a graph |
157
click to vote
JCT
2007
15 years 6 months ago
2007
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
149
click to vote
CAI
2007
Springer
16 years 11 days ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
185
click to vote
PODS
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
140
click to vote
NIPS
2008
15 years 7 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
192
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...