Path problems in skew-symmetric graphs |
| |
Authors: | Andrew V Goldberg Alexander V Karzanov |
| |
Institution: | (1) NEC Research Institute, Inc., 4 Independence Way, 08540 Princeton, NJ, USA;(2) Institute for System Analysis of Russian Acad. Sci., 9, Prospect 60 Let Oktyabrya, Moscow, Russia |
| |
Abstract: | We study path problems in skew-symmetric graphs. These problems generalize the standard graph reachability and shortest path problems. We establish combinatorial solvability criteria and duality relations for the skew-symmetric path problems and use them to design efficient algorithms for these problems. The algorithms presented are competitive with the fastest algorithms for the standard problems.This research was done while the first author was at Stanford University Computer Science Department, supported in part by ONR Office of Naval Research Young Investigator Award N00014-91-J-1855, NSF Presidential Young Investigator Grant CCR-8858097 with matching funds from AT&T, DEC, and 3M, and a grant from Powell Foundation.This research was done while the second author was visiting Stanford University Computer Science Department and supported by the above mentioned NSF and Powell Foundation Grants. |
| |
Keywords: | 05 C |
本文献已被 SpringerLink 等数据库收录! |
|