Finding hypernetworks in directed hypergraphs

DOI10.1016/j.ejor.2013.04.020zbMath1317.05076OpenAlexW1989229844MaRDI QIDQ2355938

Daniele Pretolani

Publication date: 28 July 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11380/1061404

zbMATH Keywords

graph theorydirected hypergraphshyperpaths

Mathematics Subject Classification ID

Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Cascading failures of \(k\) uniform hyper-network based on the hyper adjacent matrix ⋮ Information dissemination in dynamic hypernetwork ⋮ Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard

Cites Work

• Unnamed Item
• Flow hypergraph reducibility
• Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
• A directed hypergraph model for random time dependent shortest paths
• Finding the \(K\) shortest hyperpaths
• Directed hypergraphs and applications
• A note on minimum makespan assembly plans
• Finding the \(K\) best policies in a finite-horizon Markov decision process
• Hypernetworks in a directed hypergraph
• Bicriterion shortest hyperpaths in random time-dependent networks

This page was built for publication: Finding hypernetworks in directed hypergraphs