2432 search results - page 64 / 487 » Degrees and choice numbers |
133
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
159
click to vote
JDA
2010
15 years 29 days ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
185
click to vote
IJUFKS
2007
15 years 6 months ago
2007
Abstract. Resampling methods are among the best approaches to determine the number of clusters in prototype-based clustering. The core idea is that with the right choice for the nu...
158
click to vote
UML
2005
Springer
15 years 11 months ago
2005
Springer
UML semantic variation points provide intentional degrees of freedom for the interpretation of the metamodel semantics. The interest of semantic variation points is that UML now b...
223
click to vote
IJCV
2007
15 years 6 months ago
2007
This paper tackles an important aspect of the variational problem underlying active contours: optimization by gradient flows. Classically, the definition of a gradient depends d...