minimum disjoint path covering of a graph - algorithm needed

[SubNeo]

hello
i have a problem - i need an algorithm which computes the minimum
number of disjoint path in a labirynth.


but i think that using a graph to do it is a good idea, but all i've
found is that F.T. Boesch had written "Covering the points of a graph
with point-disjoint paths..." in 1974. or something like that.


i couldn't find that article in Internet (at least a free one)


so if someone knows where should i look for that algorithm (link would
be usefull) , please tell me.


thank you


SubNeo
(e-mail address removed)