147 search results - page 28 / 30 » Vertex partitions of chordal graphs |
DM
2010
13 years 3 months ago
2010
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
WAOA
2005
Springer
13 years 11 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
CORR
2010
Springer
13 years 5 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...
PKDD
2010
Springer
13 years 3 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...