Pages that link to "Item:Q1803674"

The following pages link to Directed hypergraphs and applications (Q1803674):

Displaying 50 items.

• Ergodicity conditions for zero-sum games (Q255787) (← links)
• Graphs, hypergraphs, and properads (Q276737) (← links)
• Effects of countdown displays in public transport route choice under severe overcrowding (Q298902) (← links)
• Solving job shop problems in the context of hypergraphs (Q351548) (← links)
• Enumeration approach to computing chemical equilibria (Q391182) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Learning Boolean logic models of signaling networks with ASP (Q498928) (← links)
• Directed hypergraphs: introduction and fundamental algorithms -- a survey (Q507517) (← links)
• Dualization of Boolean functions using ternary decision diagrams (Q513353) (← links)
• On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
• Strongly connected multivariate digraphs (Q521369) (← links)
• Linear time analysis of properties of conflict-free and general Petri nets (Q620942) (← links)
• Flow hypergraph reducibility (Q643016) (← links)
• Hypergraphs of multiparty secrets (Q656828) (← links)
• Embedding a state space model into a Markov decision process (Q666503) (← links)
• On-line algorithms for satisfiability problems with uncertainty (Q673379) (← links)
• A new decision-making method based on bipolar neutrosophic directed hypergraphs (Q721582) (← links)
• Global optimal control of perturbed systems (Q927215) (← links)
• Source location in undirected and directed hypergraphs (Q943798) (← links)
• Computing the throughput of concatenation state machines (Q954952) (← links)
• Hard problems in max-algebra, control theory, hypergraphs and other areas (Q990130) (← links)
• On finding hypercycles in chemical reaction networks (Q998585) (← links)
• Linear connectivity problems in directed hypergraphs (Q1029330) (← links)
• Sensitivity analysis for Horn formulae (Q1200328) (← links)
• On consistency in probabilistic logic for logical formulas represented by \(B\)-hypertrees (Q1296806) (← links)
• A linear time algorithm for unique Horn satisfiability (Q1313762) (← links)
• Connectivity and fault-tolerance of hyperdigraphs (Q1348372) (← links)
• A hypergraph model for constraint logic programming and applications to bus drivers' scheduling (Q1353919) (← links)
• Flows on hypergraphs (Q1373748) (← links)
• Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929) (← links)
• A simplex algorithm for a class of Leontief flow problems (Q1381763) (← links)
• On the orientation of graphs and hypergraphs (Q1410690) (← links)
• A directed hypergraph model for random time dependent shortest paths (Q1569934) (← links)
• Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation (Q1642944) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• Integrated optimization of strategic and tactical planning decisions in forestry (Q1751939) (← links)
• Extremal numbers for directed hypergraphs with two edges (Q1753023) (← links)
• Finding the \(K\) shortest hyperpaths (Q1764762) (← links)
• Partially dynamic maintenance of minimum weight hyperpaths (Q1775013) (← links)
• A note on minimum makespan assembly plans (Q1848367) (← links)
• Partitioning methods for satisfiability testing on large formulas (Q1854377) (← links)
• A new algorithm for the propositional satisfiability problem (Q1894360) (← links)
• Computing the vertices of tropical polyhedra using directed hypergraphs (Q1943657) (← links)
• Uncovering the riffled independence structure of ranked data (Q1950813) (← links)
• Finding good proofs for description logic entailments using recursive quality measures (Q2055864) (← links)
• A sharp upper bound on the spectral radius of a nonnegative \(k\)-uniform tensor and its applications to (directed) hypergraphs (Q2069307) (← links)
• The sum of its parts: analysis of federated Byzantine agreement systems (Q2084977) (← links)
• Hypergraph-based inference rules for computing \(\mathcal{EL}^+\)-ontology justifications (Q2104519) (← links)
• Siting renewable power generation assets with combinatorial optimisation (Q2119746) (← links)
• A general result on the spectral radii of nonnegative \(k\)-uniform tensors (Q2132918) (← links)