3267 search results - page 10 / 654 » Generalized quasirandom graphs |
92
Voted
STACS
2001
Springer
15 years 3 months ago
2001
Springer
Langton’s ant is a simple discrete dynamical system, with a surprisingly complex behavior. We study its extension to general planar graphs. First we give some relations between c...
112
Voted
DM
2000
14 years 10 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
114
Voted
EJC
2007
14 years 10 months ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
111
Voted
WWW
2011
ACM
14 years 5 months ago
2011
ACM
Once information retrieval has located a document, and information extraction has provided its contents, how do we know whether we should actually believe it? Fact-finders are a ...
71
Voted
GECCO
2006
Springer
15 years 2 months ago
2006
Springer
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...