Directed hypergraphs and applications☆

https://doi.org/10.1016/0166-218X(93)90045-PGet rights and content
Under an Elsevier user license
open archive

Abstract

We deal with directed hypergraphs as a tool to model and solve 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.

Cited by (0)

☆

This research has been supported in part by the “Comitato Nazionale Scienza e Tecnologia dell'Informazione”, National Research Council of Italy, under Grant no. 89.00208.12, and in part by research grants from the National Research Council of Canada.

Copyright © 1993 Published by Elsevier B.V.