1732 search results - page 35 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
172
click to vote
COMBINATORICS
1998
15 years 5 months ago
1998
Let α and β be a partition of {1, . . . , n} into two blocks. A merging network is a network of comparators which allows as input arbitrary real numbers and has the property tha...
126
click to vote
DM
2002
15 years 6 months ago
2002
In this paper, we present several conditions for K1,3-free graphs, which guarantee the graph is subpancyclic. In particular, we show that every K1,3-free graph with minimum degree...
169
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
175
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new solution concept for games, near-strong equilibrium, a variation of strong equilibrium. Previous work has shown the existence of 2-strong pure strategy equilibr...
165
click to vote
IWOCA
2009
Springer
16 years 21 days ago
2009
Springer
A circuit in a simple undirected graph G = (V, E) is a sequence of vertices {v1, v2, . . . , vk+1} such that v1 = vk+1 and {vi, vi+i} ∈ E for i = 1, . . . , k. A circuit C is sai...