5473 search results - page 55 / 1095 » On the graph isomorphism problem |
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We introduce the simultaneous representation problem, defined for any graph class C characterized in terms of representations, e.g. any class of intersection graphs. Two...
ALGORITHMICA
2006
14 years 12 months ago
2006
The k-Leaf Power recognition problem is a particular case of graph power problems: For a given graph it asks whether there exists an unrooted tree--the k-leaf root--with leaves on...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
194
click to vote
ICDE
2006
IEEE
16 years 1 months ago
2006
IEEE
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...