scientific article; zbMATH DE number 1222555

MaRDI QIDQ4218092zbMATH OpenFDO

Authors Giuseppe F. Italiano, Giorgio Ausiello, Umberto Nanni

Publication date 14 July 1999

zbMATH Keywords

algorithmscomplexitycyclepathhyperpathdirected hypergraphmeasures of optimality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Hypergraphs (05C65)

Recommendations

• Structure theorems for optimum hyperpaths in directed hypergraphs
• scientific article; zbMATH DE number 4112412
• scientific article; zbMATH DE number 2044509
• scientific article; zbMATH DE number 4057024
• Directed hypergraphs and applications

Cited in

(17)

• Finding the \(K\) best policies in a finite-horizon Markov decision process
• 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
• scientific article; zbMATH DE number 7716306 (Why is no real title available?)
• Sequence hypergraphs
• Finding hypernetworks in directed hypergraphs
• scientific article; zbMATH DE number 2044509 (Why is no real title available?)
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Optimal directed hypergraph traversal with ant-colony optimisation
• Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard
• Linear connectivity problems in directed hypergraphs

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)