| Article ID: | iaor1995277 |
| Country: | Netherlands |
| Volume: | 42 |
| Issue: | 2/3 |
| Start Page Number: | 177 |
| End Page Number: | 201 |
| Publication Date: | Apr 1993 |
| Journal: | Discrete Applied Mathematics |
| Authors: | Gallo Giorgio, Pallottino Stefano, Nguyen Sang, Longo Giustino |
| Keywords: | hypergraphs |
The authors deal with directed hypergraphs as a tool to model some classes of problems arising in operations research and in computer science. Concepts such as connectivity, paths and cuts are defined. An extension of the main duality results to a special class of hypergraphs is presented. Algorithms to perform visits of hypergraphs and to find optimal paths are studied in detail. Some applications arising in propositional logic, And-Or graphs, relational databases and transportation analysis are presented.