721 search results - page 26 / 145 » Almost universal graphs |
83
Voted
ACL
1998
15 years 2 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 ...
138
click to vote
ALGORITHMICA
2002
15 years 19 days 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...
88
Voted
DM
2010
15 years 26 days 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...
100
click to vote
RSA
2011
14 years 7 months ago
2011
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
93
Voted
HAIS
2009
Springer
15 years 5 months ago
2009
Springer
This paper presents a hybrid evolutionary algorithm to tackle university course timetabling problems. The proposed approach is an extension of a non-linear great deluge algorithm i...