scientific article; zbMATH DE number 1222555
From MaRDI portal
Publication:4218092
zbMath0916.05054MaRDI QIDQ4218092
Giuseppe F. Italiano, Giorgio Ausiello, Umberto Nanni
Publication date: 14 July 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Distance in graphs (05C12)
Related Items (8)
Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard ⋮ Optimal directed hypergraph traversal with ant-colony optimisation ⋮ Finding the \(K\) best policies in a finite-horizon Markov decision process ⋮ Directed hypergraphs: introduction and fundamental algorithms -- a survey ⋮ Shortest path algorithms for functional environments ⋮ Partially dynamic maintenance of minimum weight hyperpaths ⋮ Association Rules Network: Definition and Applications ⋮ Linear connectivity problems in directed hypergraphs
This page was built for publication:
