Sciweavers

730 search results - page 1 / 146

» Combinatorics of Monotone Computations

8

ECCC
1998

75views more ECCC 1998»

Combinatorics of Monotone Computations

13 years 4 months ago

Combinatorics of Monotone Computations

Download lovelace.thi.informatik.uni-frankfurt.de

Stasys Jukna

claim paper

Read More »

8

COMBINATORICS
2002

86views more COMBINATORICS 2002»

Computation of the Vertex Folkman Numbers F(2, 2, 2, 4;6) and F(2, 3, 4;6)

13 years 5 months ago

Computation of the Vertex Folkman Numbers F(2, 2, 2, 4;6) and F(2, 3, 4;6)

Download www.univie.ac.at

Evgeni Nedialkov, Nedyalko Dimov Nenov

claim paper

Read More »

14

COMBINATORICS
1998

62views more COMBINATORICS 1998»

A Note on the Asymptotics and Computational Complexity of Graph Distinguishability

13 years 5 months ago

A Note on the Asymptotics and Computational Complexity of Graph Distinguishability

Download www.ccs.neu.edu

Alexander Russell, Ravi Sundaram

claim paper

Read More »

14

COMBINATORICS
2002

83views more COMBINATORICS 2002»

The Minimum Number of Monotone Subsequences

13 years 5 months ago

The Minimum Number of Monotone Subsequences

Download www.combinatorics.org

Erdos and Szekeres showed that any permutation of length n k2 + 1 contains

Joseph Samuel Myers

claim paper

Read More »

12

COCOON
2009
Springer

129views Combinatorics» more COCOON 2009»

Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone

13 years 11 months ago

Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone

Download www.ii.uib.no

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...

claim paper

Read More »

« Prev « First page 1 / 146 Last » Next »