5473 search results - page 207 / 1095 » On the graph isomorphism problem |
192
click to vote
TPHOL
2008
IEEE
16 years 1 months ago
2008
IEEE
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
206
click to vote
BPM
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
207
click to vote
SGAI
2004
Springer
16 years 16 days ago
2004
Springer
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
217
click to vote
AE
2003
Springer
16 years 13 days ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
205
click to vote
INFOVIS
2002
IEEE
16 years 3 days ago
2002
IEEE
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...