scientific article; zbMATH DE number 2044509

zbMath1042.68084MaRDI QIDQ4448373

Giorgio Ausiello, Daniele Frigioni, Paolo Giulio Franciosa

Publication date: 18 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2202/22020312.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic algorithmDirected hypergraphAND/OR graphminimum weight hyperpath

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (16)

Sequence Hypergraphs ⋮ Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard ⋮ Sequence Hypergraphs: Paths, Flows, and Cuts ⋮ Hypergraph analysis based on a compatible tensor product structure ⋮ Finding the \(K\) best policies in a finite-horizon Markov decision process ⋮ A survey on hypergraph products ⋮ Data optimizations for constraint automata ⋮ Embedding a state space model into a Markov decision process ⋮ Dualization of Boolean functions using ternary decision diagrams ⋮ On the complexity of strongly connected components in directed hypergraphs ⋮ Time-optimal velocity planning by a bound-tightening technique ⋮ Primitive tensors and directed hypergraphs ⋮ The complexity of arc-colorings for directed hypergraphs ⋮ The complexity of arc-colorings for directed hypergraphs ⋮ Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation ⋮ Tropical spectral theory of tensors

This page was built for publication: