Sciweavers

730 search results - page 1 / 146
» Combinatorics of Monotone Computations
Sort
View
COMBINATORICS
2002
86views more  COMBINATORICS 2002»
15 years 7 days ago
Computation of the Vertex Folkman Numbers F(2, 2, 2, 4;6) and F(2, 3, 4;6)
Evgeni Nedialkov, Nedyalko Dimov Nenov
92
Voted
COMBINATORICS
1998
62views more  COMBINATORICS 1998»
15 years 3 days ago
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
Alexander Russell, Ravi Sundaram
80
Voted
COMBINATORICS
2002
83views more  COMBINATORICS 2002»
15 years 7 days ago
The Minimum Number of Monotone Subsequences
Erdos and Szekeres showed that any permutation of length n k2 + 1 contains
Joseph Samuel Myers
COCOON
2009
Springer
15 years 7 months ago
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
Pinar Heggernes, Federico Mancini, Charis Papadopo...