Dynamic Maintenance of Directed Hypergraphs

  title={Dynamic Maintenance of Directed Hypergraphs},
  author={Giorgio Ausiello and Umberto Nanni},
  journal={Theor. Comput. Sci.},


Publications citing this paper.
Showing 1-10 of 27 extracted citations

Dynamic maintenance of the transitive closure in disjunctive graphs

Annals of Mathematics and Artificial Intelligence • 1995
View 10 Excerpts
Highly Influenced

The Thinnest Path Problem

IEEE/ACM Transactions on Networking • 2015

A Thinner Thinnest Path Using Directional Transmissions in a Network

MILCOM 2013 - 2013 IEEE Military Communications Conference • 2013
View 1 Excerpt

Dynamic shortest path algorithms for hypergraphs

2012 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt) • 2012

The thinnest path problem for secure communications: A directed hypergraph approach

2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton) • 2012
View 1 Excerpt

Similar Papers

Loading similar papers…