1162 search results - page 37 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
130
click to vote
EOR
2008
15 years 4 months ago
2008
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
247
Voted
ICDE
2002
IEEE
16 years 5 months ago
2002
IEEE
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...
126
Voted
ICDM
2005
IEEE
15 years 9 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
135
Voted
GBRPR
2009
Springer
15 years 10 months ago
2009
Springer
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
142
click to vote
KDD
2009
ACM
16 years 4 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...