820 search results - page 35 / 164 » Inducing Temporal Graphs |
GBRPR
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
ICIP
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider a semi-supervised regression setting where we have temporal sequences of partially labeled data, under the assumption that the labels should vary slowly along a sequen...
WG
2004
Springer
15 years 5 months ago
2004
Springer
We show how to use split decomposition to compute the weighted clique number and the chromatic number of a graph and we apply these results to some classes of graphs. In particular...
DCG
2008
14 years 12 months ago
2008
The visibility graph V(X) of a discrete point set X R2 has vertex set X and an edge xy for every two points x, y X whenever there is no other point in X on the line segment betw...
102
click to vote
COMBINATORICS
2004
14 years 11 months ago
2004
The set of all orientations of a planar graph with prescribed outdegrees carries the structure of a distributive lattice. This general theorem is proven in the first part of the p...