3204 search results - page 195 / 641 » The Alcuin Number of a Graph |
209
click to vote
ICCS
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
138
click to vote
COCOON
2007
Springer
16 years 6 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
150
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
181
click to vote
PR
2007
15 years 5 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
157
click to vote
PAMI
2010
15 years 4 months ago
2010
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...