882 search results - page 115 / 177 » On the Hardness of Graph Isomorphism |
ACID
2006
13 years 10 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
DISOPT
2010
13 years 8 months ago
2010
We consider labeled Traveling Salesman Problems, defined upon a complete graph of n vertices with colored edges. The objective is to find a tour of maximum or minimum number of co...
NETWORKS
2010
13 years 7 months ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
PKDD
2010
Springer
13 years 7 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
ICCV
2011
IEEE
12 years 8 months ago
2011
IEEE
This paper addresses the challenge of recognizing behavior of groups of individuals in unconstraint surveillance environments. As opposed to approaches that rely on agglomerative ...