3204 search results - page 186 / 641 » The b-chromatic Number of a Graph |
CCCG
2008
15 years 2 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
115
click to vote
ACL
2003
15 years 2 months ago
2003
This paper proposes the “Hierarchical Directed Acyclic Graph (HDAG) Kernel” for structured natural language data. The HDAG Kernel directly accepts several levels of both chunk...
95
Voted
DAM
2008
15 years 24 days ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...
95
Voted
DM
2008
15 years 23 days ago
2008
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...
108
Voted
DM
2006
15 years 22 days ago
2006
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented grap...