scientific article; zbMATH DE number 1222555
From MaRDI portal
Publication:4218092
zbMATH Open0916.05054MaRDI QIDQ4218092FDOQ4218092
Authors: Giuseppe F. Italiano, Giorgio Ausiello, Umberto Nanni 
Publication date: 14 July 1999
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Hypergraphs (05C65)
Cited In (17)
- Dynamic maintenance of directed hypergraphs
- Association Rules Network: Definition and Applications
- Partially dynamic maintenance of minimum weight hyperpaths
- Structure theorems for optimum hyperpaths in directed hypergraphs
- Shortest path algorithms for functional environments
- Sequence Hypergraphs: Paths, Flows, and Cuts
- Finding the shortest path for a hypergraph
- Directed hypergraphs and applications
- Title not available (Why is that?)
- Sequence hypergraphs
- Finding hypernetworks in directed hypergraphs
- Title not available (Why is that?)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard
- Optimal directed hypergraph traversal with ant-colony optimisation
- Linear connectivity problems in directed hypergraphs
- Finding the \(K\) best policies in a finite-horizon Markov decision process
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4218092)
