77 search results - page 1 / 16 » A Note on the Asymptotics and Computational Complexity of Gr... |
COMBINATORICS
1998
13 years 4 months ago
1998
JDA
2006
13 years 4 months ago
2006
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
GC
2011
Springer
12 years 8 months ago
2011
Springer
Given an algebraic hypersurface O in Êd, how many simplices are necessary for a simplicial complex isotopic to O? We address this problem and the variant where all vertices of the...
TAMC
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...
MLG
2007
Springer
13 years 11 months ago
2007
Springer
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...