1952 search results - page 140 / 391 » Complete partitions of graphs |
141
click to vote
EMNLP
2006
15 years 6 months ago
2006
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
148
click to vote
DAM
2010
15 years 4 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
154
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
147
click to vote
ICOIN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
160
click to vote
CIAC
2010
Springer
15 years 8 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...