6598 search results - page 391 / 1320 » Graph Theory with Applications |
169
click to vote
DAM
2008
15 years 6 months 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...
168
click to vote
TVCG
2008
15 years 6 months ago
2008
In this paper we present an algorithm that operates on a triangular mesh and classifies each face of a triangle as either inside or outside. We present three example applications o...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A graph G is (a, b)-choosable if for any color list of size a associated with each vertices, one can choose a subset of b colors such that adjacent vertices are colored with disjoi...
185
click to vote
RP
2010
Springer
15 years 4 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
175
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
We introduce a general formulation, called non-negative graph embedding, for non-negative data decomposition by integrating the characteristics of both intrinsic and penalty graph...