2283 search results - page 148 / 457 » Bounds of Graph Characteristics |
COMBINATORICS
2006
13 years 8 months ago
2006
The linear complexity of a matrix is a measure of the number of additions, subtractions, and scalar multiplications required to multiply that matrix and an arbitrary vector. In th...
DAM
2000
13 years 8 months ago
2000
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
WAW
2010
Springer
13 years 6 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
SIAMDM
2010
13 years 2 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...