1039 search results - page 75 / 208 » Kernels and Regularization on Graphs |
COMBINATORICS
2006
15 years 21 days ago
2006
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
92
Voted
EJC
2006
15 years 20 days ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
84
Voted
EJC
2006
15 years 20 days ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
90
Voted
PR
2007
15 years 4 days ago
2007
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...
103
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...