3019 search results - page 6 / 604 » Approximating the Domatic Number |
MLQ
2002
13 years 7 months ago
2002
A real number is recursively approximable if there is a computable sequence of rational numbers converging to it. If some extra condition to the convergence is added, then the limi...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
FFA
2008
13 years 7 months ago
2008
We consider metric results for the asymptotic behavior of the number of solutions of Diophantine approximation inequalities with restricted denominators for Laurent formal power s...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...
SIAMDM
2000
13 years 7 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...