I have an undirected graph. One edge in this graph is special. I want to find all the other edges that are part of an even cycle containing the first edge.
I do not need to list all the cycles, which in essence would be NP, I think. I just need to know, for each each edge, whether this satisfies the conditions above.
The search for brute force, of course, but too slow, and I try my best to come up with something better. Any help was appreciated.
, ( ). , . , , , , , . .
, , . , . , . , , , 30 .
node, :
u,v,w e=(u,v) k=(v,w). u,v,w e,k .
u,v,w
e=(u,v)
k=(v,w)
e,k
e k , , f=(e,k), f u w, f=(e,k) f=(u,v,w). .
e
k
f=(e,k)
f
u
w
f=(u,v,w)
, , node. , .