459 search results - page 13 / 92 » Detecting induced subgraphs |
WG
2007
Springer
14 years 2 months ago
2007
Springer
Cographs are those graphs without induced path on four vertices. A graph G is a probe cograph if its vertex set can be partitioned into two sets, N (non-probes) and P (probes) wher...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
AICCSA
2007
IEEE
14 years 2 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
ISDA
2009
IEEE
14 years 3 months ago
2009
IEEE
—Protein binding sites are often represented by means of graphs capturing their most important geometrical and physicochemical properties. Searching for structural similarities a...