Dinanath_Sv's blog

By Dinanath_Sv, history, 6 weeks ago, In English

Given a tree. Maybe you know that minimum number of edge disjoint paths that cover all edges in Q/2, where Q = number of vertices with odd degree. The problem is to minimize the length of the longest path and output it. How to solve this? For the tree in the picture answer is 2.

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I beg you help me

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

up

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

nice problem no help