1736 search results - page 119 / 348 » The rank-width of Directed Graphs |
149
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
121
click to vote
COCO
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
139
Voted
PPAM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
118
click to vote
DIS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
127
click to vote
GG
2004
Springer
15 years 9 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...