3211 search results - page 237 / 643 » On the Grundy Number of a Graph |
215
click to vote
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
170
click to vote
CCCG
2008
15 years 8 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
178
click to vote
LREC
2010
15 years 8 months ago
2010
We introduce a method for automatically labelling edges of word co-occurrence graphs with semantic relations. Therefore we only make use of training data already contained within ...
152
click to vote
JPDC
2008
15 years 6 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
204
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...