Skip to main content

All Questions

3 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
6 votes
0 answers
315 views

Algorithms for computing the Resilience of Graphs

The definition of resilience with a graph $G$ w.r.t to a monotone property $\mathcal{P}$ is well known. (Global resilience) Let $\mathcal{P}$ be an increasing monotone property. The global ...
Pavan Sangha's user avatar
1 vote
1 answer
299 views

maximal sets of vertices that avoids a clique

I am looking for some known algorithm that finds, for a given graph, all the maximal sets of vertices that avoid a clique of some given size $k$. I'd prefer one written in MATLAB, but other languages ...
David's user avatar
  • 11
0 votes
1 answer
431 views

Efficient isomorphic subgraph matching with similarity scores

I'm a computer vision PhD student, and I'm looking for an efficient approximation to the following problem, which could end up helping in image to image matching. Failing that, pointers to relevant ...
emchristiansen's user avatar