3008 search results - page 185 / 602 » Independence in connected graphs |
140
click to vote
SGAI
2007
Springer
16 years 19 days ago
2007
Springer
Mining subgraphs is an area of research where we have a given set of graphs, and we search for (connected) subgraphs contained in these graphs. In this paper we focus on the analy...
162
click to vote
ISI
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. This work describes a methodology that can be used to identify structure and communication patterns within an organization based on e-mail data. The first step of the me...
176
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
166
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chorda...
163
click to vote
ICASSP
2009
IEEE
15 years 10 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...