6740 search results - page 503 / 1348 » An s -Hamiltonian Line Graph Problem |
212
click to vote
ECCC
2010
15 years 4 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
182
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
180
click to vote
ACIVS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
179
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
179
click to vote
ICDM
2008
IEEE
16 years 1 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....