| AND (2007) | |||||||||||||||
Abstract | |||||||||||||||
| Abstract. We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest paths problems. We develop duality theory for the skew-symmetric problems and use it to design efficient algorithms for the problems. The algorithms presented are competitive with the fastest algorithms for the standard problems. | |||||||||||||||
Details der Publikation | |||||||||||||||
| |||||||||||||||