Directed hypergraphs and applications
From MaRDI portal
Publication:1803674
DOI10.1016/0166-218X(93)90045-PzbMATH Open0771.05074MaRDI QIDQ1803674FDOQ1803674
Authors: Giorgio Gallo, Giustino Longo, Stefano Pallottino, Sang Nguyen 
Publication date: 29 June 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
pathsdirected hypergraphsrelational databasesconnectivitycutsoptimal pathsAnd-Or graphstransportation analysis
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Connectivity (05C40) Hypergraphs (05C65) Database theory (68P15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- On the complexity of the maximum satisfiability problem for Horn formulas
- Equilibrium traffic assignment for large scale transit networks
- Graph Algorithms for Functional Dependency Manipulation
- Minimal Representation of Directed Hypergraphs
- Minimum Covers in Relational Database Model
- Shortest path methods: A unifying approach
- Title not available (Why is that?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- Unification as a complexity measure for logic programming
- Directed recursive labelnode hypergraphs: A new representation-language
- Title not available (Why is that?)
- Algorithms for testing the satisfiability of propositional formulae
- Title not available (Why is that?)
- Dynamic maintenance of directed hypergraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dynamic Programming as Graph Searching: An Algebraic Approach
- Generalized AND/OR graphs
- Deduction graphs: an algorithm and applications
- Title not available (Why is that?)
Cited In (only showing first 100 items - show all)
- Computing the throughput of concatenation state machines
- Enumeration approach to computing chemical equilibria
- Dynamic maintenance of directed hypergraphs
- Ergodicity conditions for zero-sum games
- On finding hypercycles in chemical reaction networks
- A linear time algorithm for unique Horn satisfiability
- Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems
- On the complexity of strongly connected components in directed hypergraphs
- Max Horn SAT and the minimum cut problem in directed hypergraphs
- The complexity of arc-colorings for directed hypergraphs
- Partially dynamic maintenance of minimum weight hyperpaths
- Graphs, hypergraphs, and properads
- Hypernetworks in a directed hypergraph
- A new algorithm for the propositional satisfiability problem
- The Cartesian product of hypergraphs
- On vertex independence number of uniform hypergraphs
- Facets of the Stochastic Network Flow Problem
- Intuitionistic fuzzy shortest hyperpath in a network
- On the orientation of graphs and hypergraphs
- A sharp upper bound on the spectral radius of a nonnegative \(k\)-uniform tensor and its applications to (directed) hypergraphs
- Effects of countdown displays in public transport route choice under severe overcrowding
- A new decision-making method based on bipolar neutrosophic directed hypergraphs
- Primitive tensors and directed hypergraphs
- Diffusion operator and spectral analysis for directed hypergraph Laplacian
- Directed hypergraphs and Horn minimization
- Weighted Deductive Parsing and Knuth's Algorithm
- On the complexity of reconstructing chemical reaction networks
- Embedding a state space model into a Markov decision process
- On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees
- Hard problems in max-algebra, control theory, hypergraphs and other areas
- Computing the vertices of tropical polyhedra using directed hypergraphs
- Source location in undirected and directed hypergraphs
- Flows on hypergraphs
- A directed hypergraph model for random time dependent shortest paths
- Title not available (Why is that?)
- Equilibrium network design of shared-vehicle systems
- Studies on hypergraphs. I: Hyperforests
- Certain concepts of bipolar fuzzy directed hypergraphs
- Solving job shop problems in the context of hypergraphs
- Nonderogatory directed webgraph
- Towards the Use of Hypergraphs in Multi-adjoint Logic Programming
- Global optimal control of perturbed systems
- Flow hypergraph reducibility
- A denotational semantics for low-level probabilistic programs with nondeterminism
- The complexity of arc-colorings for directed hypergraphs
- Sensitivity analysis for Horn formulae
- Title not available (Why is that?)
- Searching for a minimal solution subgraph in explicit AND/OR graphs
- Finding the \(K\) shortest hyperpaths
- Learning Boolean logic models of signaling networks with ASP
- Hypergraphs of multiparty secrets
- Three Hypergraph Eigenvector Centralities
- Circulant tensors with applications to spectral hypergraph theory and stochastic process
- The structure and dynamics of networks with higher order interactions
- Title not available (Why is that?)
- Directed hypergraphs: introduction and fundamental algorithms -- a survey
- Dualization of Boolean functions using ternary decision diagrams
- Linear time analysis of properties of conflict-free and general Petri nets
- On-line algorithms for satisfiability problems with uncertainty
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Integrated optimization of strategic and tactical planning decisions in forestry
- Strongly connected multivariate digraphs
- Multicriteria adaptive paths in stochastic, time-varying networks
- Linear connectivity problems in directed hypergraphs
- Finding the \(K\) best policies in a finite-horizon Markov decision process
- Directed hypergraphs: a tool for researching digraphs and hypergraphs
- A note on minimum makespan assembly plans
- A simplex algorithm for a class of Leontief flow problems
- Partitioning methods for satisfiability testing on large formulas
- Partitioning methods for satisfiability testing on large formulas
- Spectra of cycle and path families of oriented hypergraphs
- Hypergraph-based inference rules for computing \(\mathcal{EL}^+\)-ontology justifications
- Title not available (Why is that?)
- The Why, How, and When of Representations for Complex Systems
- Homology of weighted path complexes and directed hypergraphs
- α-Derivable digraphs and its application in wireless sensor networking
- Association Rules Network: Definition and Applications
- The hypergraph assignment problem
- On the category of props
- Consensus formation in networks with neighbor-dependent synergy and observer effect
- Sharp bounds for the spectral radii of nonnegative tensors
- Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation
- Persistent hyperdigraph homology and persistent hyperdigraph Laplacians
- Hypergraphs in logic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Visualizing SAT instances and runs of the DPLL algorithm
- Extremal numbers for directed hypergraphs with two edges
- Sequence Hypergraphs: Paths, Flows, and Cuts
- \((k-2)\)-linear connected components in hypergraphs of rank \(k\)
- Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs
- A general result on the spectral radii of nonnegative \(k\)-uniform tensors
- Directed Moore hypergraphs
- Totally unimodular Leontief directed hypergraphs
- Uncovering the riffled independence structure of ranked data
- Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation
- Tractability, hardness, and kernelization lower bound for and/or graph solution
- Flow Hypergraph Reducibility
- A Hypergraph Network Simplex Algorithm
- Tropical spectral theory of tensors
This page was built for publication: Directed hypergraphs and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803674)
