1039 search results - page 24 / 208 » Kernels and Regularization on Graphs |
ECCC
2000
15 years 9 days ago
2000
We design a 0:795 approximation algorithm for the Max-Bisection problem restricted to regular graphs. In the case of three regular graphs our results imply an approximation ratio ...
115
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
103
Voted
STOC
2003
ACM
16 years 23 days ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
121
Voted
JGT
2007
15 years 11 days ago
2007
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
98
Voted
DM
2006
15 years 15 days ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...