5473 search results - page 17 / 1095 » On the graph isomorphism problem |
WG
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
79
Voted
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
138
click to vote
PKDD
2004
Springer
15 years 5 months ago
2004
Springer
The problem of discovering frequent subgraphs of graph data can be solved by constructing a candidate set of subgraphs first, and then, identifying within this candidate set those...
109
click to vote
ICDE
2011
IEEE
14 years 3 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
100
click to vote
DAM
2007
14 years 11 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...