725 search results - page 56 / 145 » Bounding Degrees on RPL |
92
Voted
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
111
click to vote
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
82
Voted
VLDB
1989
ACM
15 years 4 months ago
1989
ACM
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
JC
2006
15 years 21 days ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
97
Voted
ARSCOM
2004
15 years 18 days ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...