34 search results - page 5 / 7 » Finding maximal k-edge-connected subgraphs from a large grap... |
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
DLT
2006
13 years 9 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
SDM
2008
SIAM
13 years 9 months ago
2008
SIAM
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
VLSID
2008
IEEE
14 years 8 months ago
2008
IEEE
In the automatic design of custom instruction set processors, there can be a very large set of potential custom instructions, from which a few instructions are required to be chos...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...