1162 search results - page 22 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
124
click to vote
ICPR
2002
IEEE
16 years 4 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
122
click to vote
COMBINATORICS
2006
15 years 3 months 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...
108
Voted
CAIP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper, we introduce a prototype-based clustering algorithm dealing with graphs. We propose a hypergraph-based model for graph data sets by allowing clusters overl...
145
click to vote
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
In wireless sensor networks (WSNs), sensor nodes are typically subjected to energy constraints and often prone to topology changes. While duty cycling has been widely used for ener...
140
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...