Directed hypergraphs: introduction and fundamental algorithms -- a survey
From MaRDI portal
Publication:507517
DOI10.1016/j.tcs.2016.03.016zbMath1356.68159OpenAlexW2299844414MaRDI QIDQ507517
Publication date: 6 February 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.03.016
Database theory (68P15) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Directed graphs (digraphs), tournaments (05C20)
Related Items
Whitney's connectivity inequalities for directed hypergraphs ⋮ The abstract Laplacian tensor of a hypergraph with applications in clustering ⋮ Homology of weighted path complexes and directed hypergraphs ⋮ Computing shortest hyperpaths for pathway inference in cellular reaction networks ⋮ Fuzzy logic programs as hypergraphs. Termination results ⋮ Tropical Carathéodory with matroids ⋮ Even order uniform hypergraph via the Einstein product ⋮ Network dynamics with higher-order interactions: coupled cell hypernetworks for identical cells and synchrony ⋮ What Are Higher-Order Networks? ⋮ Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard ⋮ Hypernetworks: Cluster Synchronization Is a Higher-Order Effect ⋮ Persistent hyperdigraph homology and persistent hyperdigraph Laplacians ⋮ Hypergraph analysis based on a compatible tensor product structure ⋮ Generating functions of some families of directed uniform hypergraphs ⋮ Optimal directed hypergraph traversal with ant-colony optimisation ⋮ Consensus formation in networks with neighbor-dependent synergy and observer effect ⋮ Towards the Use of Hypergraphs in Multi-adjoint Logic Programming ⋮ Hypergraph-based inference rules for computing \(\mathcal{EL}^+\)-ontology justifications
Cites Work
- The joy of implications, aka pure Horn formulas: mainly a survey
- Hydras: complexity on general graphs and a subclass of trees
- Hydras: directed hypergraphs and Horn formulas
- Linear time analysis of properties of conflict-free and general Petri nets
- On-line algorithms for satisfiability problems with uncertainty
- Linear connectivity problems in directed hypergraphs
- Equilibrium traffic assignment for large scale transit networks
- An observation on time-storage trade off
- Directed recursive labelnode hypergraphs: A new representation-language
- A generalization of Dijkstra's algorithm
- On the orientation of graphs and hypergraphs
- Edge splitting and connectivity augmentation in directed hypergraphs.
- A directed hypergraph model for random time dependent shortest paths
- Partially dynamic maintenance of minimum weight hyperpaths
- Directed hypergraphs and applications
- Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks
- Graph Algorithms for Functional Dependency Manipulation
- Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Minimal Representation of Directed Hypergraphs
- Algorithms for testing the satisfiability of propositional formulae
- Minimum Covers in Relational Database Model
- On-line algorithms for polynomially solvable satisfiability problems
- Approximating the Minimum Equivalent Digraph
- An Incremental Algorithm for a Generalization of the Shortest-Path Problem
- The Transitive Reduction of a Directed Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
