316 search results - page 27 / 64 » On almost self-complementary graphs |
117
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
98
Voted
ACL
1998
15 years 4 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
154
Voted
ALGORITHMICA
2002
15 years 2 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
109
Voted
DM
2010
15 years 2 months ago
2010
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...
139
Voted
SPIRE
2010
Springer
15 years 20 days ago
2010
Springer
Next generation sequencing (NGS) technologies are being applied to many fields of biology, notably to survey the polymorphism across individuals of a species. However, while single...