shortest directed odd cycle

Posted by gleb-pendler on Stack Overflow See other posts from Stack Overflow or by gleb-pendler
Published on 2010-06-12T23:35:39Z Indexed on 2010/06/12 23:42 UTC
Read the original article Hit count: 406

6.1.4 Describe an algorithm based on breadth-first search for finding a shortest odd cycle in a graph.

6.3.5 Describe an algorithm based on directed breadth-first search for finding a shortest directed odd cycle in a digraph.

what is most importent is that it must be a directed graph not necessary bfs but must be the shortest directed odd cycle!!!

Question was taken from "Graph Theory" by J.A. Bondy and U.S.R. Murty

thanks in advance!!!

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about books