Directed hypergraphs and applications

From MaRDI portal

Publication:1803674

Jump to:navigation, search

DOI10.1016/0166-218X(93)90045-PzbMath0771.05074MaRDI QIDQ1803674

Giorgio Gallo, Sang Nguyen, Giustino Longo, Stefano Pallottino

Publication date: 29 June 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

paths connectivity relational databases directed hypergraphs cuts optimal paths And-Or graphs transportation analysis

Mathematics Subject Classification ID

Applications of graph theory (05C90) Database theory (68P15) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items

Unnamed Item, Homology of weighted path complexes and directed hypergraphs, Sharp bounds for the spectral radii of nonnegative tensors, Computing shortest hyperpaths for pathway inference in cellular reaction networks, Community Detection in General Hypergraph Via Graph Embedding, Fuzzy logic programs as hypergraphs. Termination results, Even order uniform hypergraph via the Einstein product, Pinning control of linear systems on hypergraphs, Coloring directed hypergraphs, Cosh gradient systems and tilting, Network dynamics with higher-order interactions: coupled cell hypernetworks for identical cells and synchrony, Finding \((s,d)\)-hypernetworks in F-hypergraphs is NP-hard, Persistent hyperdigraph homology and persistent hyperdigraph Laplacians, The structure and dynamics of networks with higher order interactions, Sequence Hypergraphs: Paths, Flows, and Cuts, Hypergraph analysis based on a compatible tensor product structure, On spectral theory of a k-uniform directed hypergraph, EVENT GRAPHS: ADVANCES AND APPLICATIONS OF SECOND-ORDER TIME-UNFOLDED TEMPORAL NETWORK MODELS, Facets of the Stochastic Network Flow Problem, On-line algorithms for satisfiability problems with uncertainty, Searching for a minimal solution subgraph in explicit AND/OR graphs, The complexity of arc-colorings for directed hypergraphs, The complexity of arc-colorings for directed hypergraphs, The Role of Structural Reasoning in the Genesis of Graph Theory, Towards the Use of Hypergraphs in Multi-adjoint Logic Programming, Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation, Siting renewable power generation assets with combinatorial optimisation, Certain concepts of bipolar fuzzy directed hypergraphs, Circulant tensors with applications to spectral hypergraph theory and stochastic process, Graphs, hypergraphs, and properads, The Cartesian product of hypergraphs, Whitney's connectivity inequalities for directed hypergraphs, A general result on the spectral radii of nonnegative \(k\)-uniform tensors, A denotational semantics for low-level probabilistic programs with nondeterminism, Effects of countdown displays in public transport route choice under severe overcrowding, Partial line directed hypergraphs, Connectivity and fault-tolerance of hyperdigraphs, A new algorithm for the propositional satisfiability problem, Sequence Hypergraphs, Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation, A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, Solving job shop problems in the context of hypergraphs, Partitioning methods for satisfiability testing on large formulas, Flows on hypergraphs, Directed hypergraphs and Horn minimization, MathOptInterface: A Data Structure for Mathematical Optimization Problems, Max Horn SAT and the minimum cut problem in directed hypergraphs, A simplex algorithm for a class of Leontief flow problems, Tractability, hardness, and kernelization lower bound for and/or graph solution, Enumeration approach to computing chemical equilibria, On vertex independence number of uniform hypergraphs, Weighted Deductive Parsing and Knuth's Algorithm, On constructing morphological erosion of intuitionistic fuzzy hypergraphs, Linear time analysis of properties of conflict-free and general Petri nets, Flow Hypergraph Reducibility, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, Computing the vertices of tropical polyhedra using directed hypergraphs, Spreading linear triple systems and expander triple systems, Generating functions of some families of directed uniform hypergraphs, Optimal directed hypergraph traversal with ant-colony optimisation, On the orientation of graphs and hypergraphs, Finding the \(K\) best policies in a finite-horizon Markov decision process, Good and nice colorings of balanced hypergraphs, Uncovering the riffled independence structure of ranked data, Data optimizations for constraint automata, Flow hypergraph reducibility, Intuitionistic fuzzy shortest hyperpath in a network, Consensus formation in networks with neighbor-dependent synergy and observer effect, Global optimal control of perturbed systems, Hypergraphs of multiparty secrets, Embedding a state space model into a Markov decision process, Visualizing SAT instances and runs of the DPLL algorithm, Source location in undirected and directed hypergraphs, Learning Boolean logic models of signaling networks with ASP, On-line algorithms for satisfiability problems with uncertainty, Directed hypergraphs: introduction and fundamental algorithms -- a survey, Hypernetworks in a directed hypergraph, Dualization of Boolean functions using ternary decision diagrams, Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs, Computing the throughput of concatenation state machines, On the complexity of strongly connected components in directed hypergraphs, Integrated optimization of strategic and tactical planning decisions in forestry, Extremal numbers for directed hypergraphs with two edges, Strongly connected multivariate digraphs, Sensitivity analysis for Horn formulae, Unnamed Item, On the complexity of reconstructing chemical reaction networks, Equilibrium network design of shared-vehicle systems, Minimal functional routes in directed graphs with dependent edges, Finding the \(K\) shortest hyperpaths, Primitive tensors and directed hypergraphs, Unnamed Item, Multicriteria adaptive paths in stochastic, time-varying networks, Unnamed Item, Partially dynamic maintenance of minimum weight hyperpaths, Unnamed Item, Hard problems in max-algebra, control theory, hypergraphs and other areas, A new decision-making method based on bipolar neutrosophic directed hypergraphs, Sharp bounds for spectral radius of nonnegative weakly irreducible tensors, A Hypergraph Network Simplex Algorithm, A game theory approach to the existence and uniqueness of nonlinear Perron-Frobenius eigenvectors, On finding hypercycles in chemical reaction networks, On the category of props, Spectral directed hypergraph theory via tensors, Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems, α-Derivable digraphs and its application in wireless sensor networking, Association Rules Network: Definition and Applications, Finding good proofs for description logic entailments using recursive quality measures, Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy, Linear connectivity problems in directed hypergraphs, A sharp upper bound on the spectral radius of a nonnegative \(k\)-uniform tensor and its applications to (directed) hypergraphs, Diffusion operator and spectral analysis for directed hypergraph Laplacian, A directed hypergraph model for random time dependent shortest paths, Spectra of cycle and path families of oriented hypergraphs, The sum of its parts: analysis of federated Byzantine agreement systems, On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees, A note on minimum makespan assembly plans, The Why, How, and When of Representations for Complex Systems, The hypergraph assignment problem, Partitioning methods for satisfiability testing on large formulas, Hypergraph-based inference rules for computing \(\mathcal{EL}^+\)-ontology justifications, A linear time algorithm for unique Horn satisfiability, Tropical spectral theory of tensors, Three Hypergraph Eigenvector Centralities, Ergodicity conditions for zero-sum games, Finding hypernetworks in directed hypergraphs

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1803674&oldid=14161202"