5473 search results - page 252 / 1095 » On the graph isomorphism problem |
169
click to vote
ICDM
2008
IEEE
16 years 1 months ago
2008
IEEE
In this work, we study a visual data mining problem: Given a set of discovered overlapping submatrices of interest, how can we order the rows and columns of the data matrix to bes...
184
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
194
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
136
click to vote
BIRTHDAY
2005
Springer
16 years 25 days ago
2005
Springer
In the double-pushout approach to graph transformations, most authors assume the left-hand side to be injective, since the noninjective case leads to ambiguous results. Taking into...
211
click to vote
WAOA
2005
Springer
16 years 23 days ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...