Hypernetworks in a directed hypergraph
From MaRDI portal
Publication:2470103
DOI10.1016/j.ejor.2007.04.023zbMath1190.90035OpenAlexW2032987985MaRDI QIDQ2470103
Publication date: 13 February 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.04.023
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items (10)
Synchronization of an evolving complex hyper-network ⋮ Finding optimal hyperpaths in large transit networks with realistic headway distributions ⋮ Cascading failures of \(k\) uniform hyper-network based on the hyper adjacent matrix ⋮ Information dissemination in dynamic hypernetwork ⋮ Even order uniform hypergraph via the Einstein product ⋮ Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard ⋮ Hypergraph analysis based on a compatible tensor product structure ⋮ Identifying lead users in online user innovation communities based on supernetwork ⋮ Minimal functional routes in directed graphs with dependent edges ⋮ Finding hypernetworks in directed hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Equilibrium traffic assignment for large scale transit networks
- Supply chain partnerships: Opportunities for operations research
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- Finding the \(K\) shortest hyperpaths
- Directed hypergraphs and applications
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Genetic algorithm solution for a risk-based partner selection problem in a virtual enterprise
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications
This page was built for publication: Hypernetworks in a directed hypergraph
