Velocity Reviews - Computer Hardware Reviews

Velocity Reviews > Newsgroups > Programming > C Programming > minimum disjoint path covering of a graph - algorithm needed

Reply
Thread Tools

minimum disjoint path covering of a graph - algorithm needed

 
 
SubNeo
Guest
Posts: n/a
 
      10-26-2005
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 Removed)

 
Reply With Quote
 
 
 
Reply

Thread Tools

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are Off


Similar Threads
Thread Thread Starter Forum Replies Last Post
minimum disjoint path covering of a graph - algorithm needed SubNeo C Programming 3 10-26-2005 02:26 PM
minimum disjoint path covering of a graph - algorithm needed SubNeo C++ 2 10-26-2005 12:45 PM
Re: Recursion problem - Graph theory - Algorithm needed Allan W C++ 4 01-22-2004 02:42 PM
Recursion problem - Graph theory - Algorithm needed JimC C++ 3 01-17-2004 12:43 PM
GD::Graph: "mixed" graph doesn't recognize "area" graph type Emilio Mayorga Perl Misc 6 10-08-2003 02:14 AM



Advertisments