352 search results - page 20 / 71 » Partitioning Graphs into Connected Parts |
128
click to vote
GC
2006
Springer
15 years 4 months ago
2006
Springer
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
122
click to vote
ACL
2009
15 years 1 months ago
2009
Identifying whether a multi-word expression (MWE) is compositional or not is important for numerous NLP applications. Sense induction can partition the context of MWEs into semant...
128
click to vote
AICCSA
2007
IEEE
15 years 8 months ago
2007
IEEE
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In noncontiguous allocation, a ...
148
Voted
CPC
2004
15 years 3 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
134
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...