On the public citation graph

Max Horn SAT and the minimum cut problem in directed hypergraphs

https://doi.org/10.1007/bf01581727
0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9781118627372openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.1007/bf01209713openalex-snapshot
Satisfiability of co-nested formulas
inferredcites →https://doi.org/10.1007/bf01581090openalex-snapshot
Gainfree Leontief substitution flow problems
inferredcites →https://doi.org/10.1007/bf02614364openalex-snapshot
Network optimization: Algorithms and applications
inferredcites →https://doi.org/10.1007/bf02614371openalex-snapshot
Flows on hypergraphs
inferredcites →https://doi.org/10.1016/0020-0190(87)90028-7openalex-snapshot
On the complexity of the maximum satisfiability problem for horn formulas
inferredcites →https://doi.org/10.1016/0166-218x(93)90045-popenalex-snapshot
Directed hypergraphs and applications
inferredcites →https://doi.org/10.1016/0304-3975(90)90030-lopenalex-snapshot
Dynamic maintenance of directed hypergraphs
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/b978-0-08-040806-4.50007-1openalex-snapshot
BOOLEAN-COMBINATORIAL BOUNDING OF MAXIMUM 2-SATISFIABILITY
inferredcites →https://doi.org/10.1090/dimacs/026/19openalex-snapshot
A linear programming and rounding approach to max 2-SAT
inferredcites →https://doi.org/10.1137/s0895480192243516openalex-snapshot
New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
inferredcites →https://doi.org/10.1145/227683.227684openalex-snapshot
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
inferredcites →https://doi.org/10.1287/ijoc.1.1.7openalex-snapshot
Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
inferredcites →https://doi.org/10.2307/2583737openalex-snapshot
Integer and Combinatorial Optimization
inferredcites →https://doi.org/10.2307/2583807openalex-snapshot
Logic-Based Decision Support: Mixed Integer Model Formulation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45446-2_20openalex-snapshot
Directed Hypergraphs: Problems, Algorithmic Results, and a Novel Decremental Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-28702-7openalex-snapshot
Graph Structures for Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-28702-7_5openalex-snapshot
Combinatorial Results on Directed Hypergraphs for the SAT Problem
inferred← citeshttps://doi.org/10.1007/978-981-95-7127-7_37openalex-snapshot
On the Complexity of Hyperpath and Minimal Separator Enumeration in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/bf02735318openalex-snapshot
Directed hypergraphs as a modelling paradigm
inferred← citeshttps://doi.org/10.1007/bfb0098228openalex-snapshot
Randomness in heuristics: An experimental investigation for the maximum satisfiability problem
inferred← citeshttps://doi.org/10.1007/s00453-012-9729-0openalex-snapshot
On the Complexity of Strongly Connected Components in Directed Hypergraphs
inferred← citeshttps://doi.org/10.1007/s10479-010-0688-zopenalex-snapshot
Embedding a state space model into a Markov decision process
inferred← citeshttps://doi.org/10.1016/j.biosystems.2008.06.015openalex-snapshot
Modes and cuts in metabolic networks: Complexity and algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2003.11.014openalex-snapshot
Finding the K shortest hyperpaths
inferred← citeshttps://doi.org/10.1016/j.disc.2005.12.044openalex-snapshot
Good and nice colorings of balanced hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2007.04.023openalex-snapshot
Hypernetworks in a directed hypergraph
inferred← citeshttps://doi.org/10.1016/j.jda.2003.12.005openalex-snapshot
Partially dynamic maintenance of minimum weight hyperpaths
inferred← citeshttps://doi.org/10.1023/a:1012332915908openalex-snapshot
Easy Cases of Probabilistic Satisfiability
inferred← citeshttps://doi.org/10.1109/iske.2015.72openalex-snapshot
The New Directed Hypergraph for CNF Formula of Propositional Logic
inferred← citeshttps://doi.org/10.1109/tac.2021.3060706openalex-snapshot
A Graph-Based Algorithm for Optimal Control of Switched Systems:An Application to Car Parking
inferred← citeshttps://doi.org/10.1109/tcbb.2017.2781724openalex-snapshot
Chemical Transformation Motifs—Modelling Pathways as Integer Hyperflows
inferred← citeshttps://doi.org/10.1137/s009753970037727xopenalex-snapshot
Scheduling with AND/OR Precedence Constraints
inferred← citeshttps://doi.org/10.1137/s1052623498343477openalex-snapshot
Auction Algorithms for Shortest Hyperpath Problems
inferred← citeshttps://doi.org/10.14279/depositonce-398openalex-snapshot
Stochastic resource-constrained project scheduling
inferred← citeshttps://doi.org/10.2498/cit.1001287openalex-snapshot
Horn Renamability and Hypergraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11831openalex-snapshot
Hierarchical Decompositions of dihypergraphs
inferred← citeshttps://doi.org/10.61356/j.hsse.2025.3462openalex-snapshot
Fundamental Computational Problems and Algorithms for SuperHyperGraphs
inferred← citeshttps://doi.org/10.70675/41ec01ebz2076z48adzb8ffzd32c8cd8403eopenalex-snapshot
Hypernode graphs for learning from binary relations between sets of objects
inferred← citeshttps://doi.org/10.70675/cd100171z6007z45ccz94c2zd4d0e5fc85aaopenalex-snapshot
Models and algorithms for metabolic networks : elementary modes and precursor sets
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.