4865 search results - page 241 / 973 » The Complexity of Graph Connectivity |
129
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We investigate a method using support vector machines (SVMs) with walk-based graph kernels for high-level feature extraction from images. In this method, each image is first segme...
143
Voted
DAM
2007
15 years 5 months ago
2007
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...
163
click to vote
GC
2007
Springer
15 years 5 months ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
125
Voted
JGT
2007
15 years 5 months ago
2007
Laman’s characterization of minimally rigid 2-dimensional generic frameworks gives a matroid structure on the edge set of the underlying graph, as was first pointed out and expl...
123
click to vote
SDM
2009
SIAM
16 years 2 months ago
2009
SIAM
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...