459 search results - page 23 / 92 » Detecting induced subgraphs |
CSE
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
CORR
2012
Springer
12 years 4 months ago
2012
Springer
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
VIS
2007
IEEE
14 years 9 months ago
2007
IEEE
Abstract--We present a method to extract and visualize vortices that originate from bounding walls of three-dimensional timedependent flows. These vortices can be detected using th...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Classifiers are often used to detect miscreant activities. We study how an adversary can systematically query a classifier to elicit information that allows the adversary to evade...