minimum disjoint path covering of a graph - algorithm needed

Discussion in 'C Programming' started by SubNeo, Oct 26, 2005.

  1. SubNeo

    SubNeo Guest

    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
     
    SubNeo, Oct 26, 2005
    #1
    1. Advertising

Want to reply to this thread or ask your own question?

It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
  1. JimC
    Replies:
    3
    Views:
    525
  2. Allan W
    Replies:
    4
    Views:
    529
    Jos A. Horsmeier
    Jan 22, 2004
  3. SubNeo
    Replies:
    3
    Views:
    347
    Richard Bos
    Oct 26, 2005
  4. SubNeo
    Replies:
    2
    Views:
    435
    Jeff Flinn
    Oct 26, 2005
  5. Emilio Mayorga
    Replies:
    6
    Views:
    342
    Martien Verbruggen
    Oct 8, 2003
Loading...

Share This Page