0
$\begingroup$

I have an undirected, unweighted graph $G=(V,E)$, and a function $f:V\to [0,1]$ where $[0,1]$ denotes the interval of real numbers from $0$ to $1$ inclusive.

Given an input threshold $t\in [0,1]$, I need an algorithm which returns all maximum sized connected sub-graphs $H\subseteq G$, such that every node $u\in H$ has $f(u)>t$.

Can you please provide an algorithm suggestion or point me in the right direction?

$\endgroup$
2

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.