The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Directed hypergraphs and applications
Open accessAbstract
This paper deals with directed hypergraphs as a tool to model and solve some calsses of problems arising in Operations Research and in Computer Science. Concepts such as connectivity, paths and cuts are defined. An extension of the amin duality results to a special class of hypergraphs is presented. Algorithms to perform visits of hypergraphs and to find optimal paths are studied in detail. Some applications arising in propositional logic, An-Or graphs, relational data bases and transportation analysis are presented. (A)
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Linear-time algorithms for testing the satisfiability of propositional horn formulae
Dowling, W. F., & Gallier, J. H. (1984) · The Journal of Logic Programming · doi:10.1016/0743-1066(84)90014-1 · Cited by 1,013
Equilibrium traffic assignment for large scale transit networks
Nguyen, S., & Pallottino, S. (1988) · European Journal of Operational Research · doi:10.1016/0377-2217(88)90327-x · Cited by 389
Self-citationMinimum Covers in Relational Database Model
Maier, D. (1980) · Journal of the ACM · doi:10.1145/322217.322223 · Cited by 134
Graph Algorithms for Functional Dependency Manipulation
Giorgio Ausiello, A., D’Atri, A., & Saccà, D. (1983) · Journal of the ACM · doi:10.1145/2157.322404 · Cited by 94
Algorithms for testing the satisfiability of propositional formulae
Gallo, G., & Urbani, G. (1989) · The Journal of Logic Programming · doi:10.1016/0743-1066(89)90009-5 · Cited by 94
Self-citationLevi, G., & Sirovich, F. (1976) · Artificial Intelligence · doi:10.1016/0004-3702(76)90006-0 · Cited by 53
Directed recursive labelnode hypergraphs: A new representation-language
Boley, H. (1977) · Artificial Intelligence · doi:10.1016/0004-3702(77)90014-5 · Cited by 51
On the complexity of the maximum satisfiability problem for horn formulas
Jaumard, B., & Simeone, B. (1987) · Information Processing Letters · doi:10.1016/0020-0190(87)90028-7 · Cited by 49
Dynamic maintenance of directed hypergraphs
Ausiello, G., Nanni, U., & Italiano, G. F. (1990) · Theoretical Computer Science · doi:10.1016/0304-3975(90)90030-l · Cited by 42
Cited by
Learning with Hypergraphs: Clustering, Classification, and Embedding
Zhou, D., Huang, J., & Schölkopf, B. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0205 · Cited by 1,283
Hypergraphs and Cellular Networks
Klamt, S., Haus, U.-U., & Theis, F. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000385 · Cited by 480
The structure and dynamics of networks with higher order interactions
Boccaletti, S., De Lellis, P., del Genio, C. I., Alfaro-Bittner, K., Criado, R., Jalan, S., & Romance, M. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.04.002 · Cited by 364
Huang, L., & Chiang, D. (2005) · Proceedings of the Ninth International Workshop on Parsing Technology - Parsing '05 · doi:10.3115/1654494.1654500 · Cited by 291
A General Fixed-Point Approach to Multimode Multi-User Equilibrium Assignment with Elastic Demand
Cantarella, G. E. (1997) · Transportation Science · doi:10.1287/trsc.31.2.107 · Cited by 259
Metadata
- Authors
- Gallo, G., Longo, G., Pallottino, S., & Nguyen, S.
- Venue
- Discrete Applied Mathematics
- Publisher
- Elsevier BV
- Published
- 1993-04
- Volume
- 42
- Issue
- 2-3
- Pages
- 177-201
- ISSN
- 0166-218X (ISSN-L)
- OpenAlex
- W1546862091
- Cited by
- 705
- References
- 11
- FWCI
- 4.52
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Directed hypergraphs and applications. https://app.cochat.ai/papers/10.1016/0166-218x(93)90045-p
- The paper
- Gallo, G., Longo, G., Pallottino, S., & Nguyen, S. (1993). Directed hypergraphs and applications. Discrete Applied Mathematics. https://doi.org/10.1016/0166-218x(93)90045-p
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.