Hypergraph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hypergraph" in English language version.

refsWebsite

Global rank English rank

41doi.org

2^nd place

14web.archive.org

1^st place

8semanticscholar.org

11^th place

8^th place

6worldcat.org

5^th place

6arxiv.org

69^th place

59^th place

6nih.gov

4^th place

4harvard.edu

18^th place

17^th place

2ams.org

451^st place

277^th place

2books.google.com

3^rd place

2psu.edu

207^th place

136^th place

1inria.fr

4,903^rd place

3,679^th place

1handle.net

102^nd place

76^th place

1unl.edu

1,708^th place

1,051^st place

1ruizhang.info

low place

1springer.com

274^th place

309^th place

1ieee.org

652^nd place

515^th place

1researchgate.net

120^th place

125^th place

1smu.edu.sg

low place

1archive.org

6^th place

1ifca.ai

low place

1uni-koeln.de

2,455^th place

3,121^st place

1jgaa.info

low place

1troy.edu

low place

1bham.ac.uk

6,934^th place

4,192^nd place

1computer.org

5,196^th place

3,635^th place

1unt.edu

1,336^th place

769^th place

1osti.gov

2,036^th place

1,254^th place

1hypernetx.readthedocs.io

low place

1opencog.org

low place

1centre-mersenne.org

low place

1cmu.edu

1,564^th place

1,028^th place

1wiley.com

222^nd place

297^th place

1cambridge.org

305^th place

264^th place

1sciencedirect.com

149^th place

178^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Haussler, David; Welzl, Emo (1987), "ε-nets and simplex range queries", Discrete and Computational Geometry, 2 (2): 127–151, doi:10.1007/BF02187876, MR 0884223.
Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549

archive.org (Global: 6^th place; English: 6^th place)

Goldstein, A. (1982). "A Directed Hypergraph Database: A Model for the Local Loop Telephone Plant". Bell System Technical Journal. 61 (9): 2529–54. doi:10.1002/j.1538-7305.1982.tb03439.x. S2CID 11290643.

arxiv.org (Global: 69^th place; English: 59^th place)

Ouvrard, Xavier (2020), "Hypergraphs: an introduction and review", arXiv:2002.05014 [cs.DM].
Ghoshal, Gourab; Zlatic, Vinko; Caldarelli, Guido; Newman, Mark E.J. (2009), "Random Hypergraphs and their applications", Physical Review E, 79 (6) 066118, arXiv:0903.0419, Bibcode:2009PhRvE..79f6118G, doi:10.1103/PhysRevE.79.066118, PMID 19658575, S2CID 6391099
Zhao, Y. (2016). "Recent advances on Dirac-type problems for hypergraphs". Recent Trends in Combinatorics. The IMA Volumes in Mathematics and its Applications. Vol. 159. pp. 145–165. arXiv:1508.06170. doi:10.1007/978-3-319-24298-9_6. ISBN 978-3-319-24296-5.
Sudakov, B.; Tomon, I. (2022). "The Extremal Number of Tight Cycles". International Mathematics Research Notices. 2022 (13): 9663–9684. arXiv:2009.00528. doi:10.1093/imrn/rnaa396.
Popp, Merten; Schlag, Sebastian; Schulz, Christian; Seemaier, Daniel (2020-10-15), Multilevel Acyclic Hypergraph Partitioning, arXiv, doi:10.48550/arXiv.2002.02962, arXiv:2002.02962, retrieved 2025-11-19
Parui, Samiron (2024-09-24), On the Incidence matrices of hypergraphs, arXiv, doi:10.48550/arXiv.2409.16055, arXiv:2409.16055, retrieved 2025-11-19

bham.ac.uk (Global: 6,934^th place; English: 4,192^nd place)

web.mat.bham.ac.uk

Kühn, D.; Osthus, D. (2014). "Hamilton cycles in graphs and hypergraphs: an extremal perspective" (PDF). Proceeding of the International Congress of Mathematicans: 381–406. ISBN 978-89-6105-807-0.

books.google.com (Global: 3^rd place; English: 3^rd place)

Pearl, Judea (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Company. p. 25. ISBN 978-0-201-05594-8. Archived from the original on 2023-02-04. Retrieved 2021-06-12.
Harary, F. (2018) [1969]. Graph Theory. CRC Press. p. 172. ISBN 978-0-429-96231-8. Archived from the original on 2023-02-04. Retrieved 2021-06-12. We next state a theorem due to Elayne Dauber whose corollaries describe properties of line-symmetric graphs. Note the obvious but important observation that every line-symmetric graph is line-regular.

cambridge.org (Global: 305^th place; English: 264^th place)

Bushaw, Neal; Kettle, Nathan (November 2011). "Turán Numbers of Multiple Paths and Equibipartite Forests". Combinatorics, Probability and Computing. 20 (6): 837–853. doi:10.1017/S0963548311000460. ISSN 1469-2163.

centre-mersenne.org (Global: low place; English: low place)

igt.centre-mersenne.org

Bertschinger, Daniel; El Maalouly, Nicolas; Kleist, Linda; Miltzow, Tillmann; Weber, Simon (2025). "The Complexity of Recognizing Geometric Hypergraphs". Innovations in Graph Theory (in French). 2: 157–190. doi:10.5802/igt.9. ISSN 3050-743X.

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

cs.cmu.edu

Kannin, Ravi; Hopcroft, John. "Chapter 4" (PDF). 4 Random Graphs (PDF). p. 16.{{cite book}}: CS1 maint: url-status (link)

computer.org (Global: 5,196^th place; English: 3,635^th place)

Yu, C. T.; Özsoyoğlu, M. Z. (1979). "An algorithm for tree-query membership of a distributed query" (PDF). COMPSAC 79. Proceedings. Computer Software and the IEEE Computer Society's Third International Applications Conference, 1979. pp. 306–312. doi:10.1109/CMPSAC.1979.762509. Archived from the original (PDF) on 2018-09-02. Retrieved 2018-09-02.

doi.org (Global: 2^nd place; English: 2^nd place)

Valdivia, Paola; Buono, Paolo; Plaisant, Catherine; Dufournaud, Nicole; Fekete, Jean-Daniel (2020). "Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization" (PDF). IEEE Transactions on Visualization and Computer Graphics. 26 (1). IEEE: 12. doi:10.1109/TVCG.2019.2933196. eISSN 1941-0506. hdl:11586/518500. ISSN 1077-2626. PMID 31398121. S2CID 199518871. Archived (PDF) from the original on 2021-01-26. Retrieved 2020-09-08.
Haussler, David; Welzl, Emo (1987), "ε-nets and simplex range queries", Discrete and Computational Geometry, 2 (2): 127–151, doi:10.1007/BF02187876, MR 0884223.
Feige, Uriel; Kim, Jeong Han; Ofek, Eran (2006). "Witnesses for non-satisfiability of dense random 3CNF formulas". 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE. pp. 497–508. doi:10.1109/FOCS.2006.78. ISBN 0-7695-2720-5.
Beeri, C.; Fagin, R.; Maier, D.; Yannakakis, M. (1983). "On the Desirability of Acyclic Database Schemes" (PDF). Journal of the ACM. 30 (3): 479–513. doi:10.1145/2402.322389. S2CID 2418740. Archived (PDF) from the original on 2021-04-21. Retrieved 2021-01-03.
Huang, Jin; Zhang, Rui; Yu, Jeffrey Xu (2015). "Scalable Hypergraph Learning and Processing". 2015 IEEE International Conference on Data Mining (PDF). pp. 775–780. doi:10.1109/ICDM.2015.33. ISBN 978-1-4673-9504-5. S2CID 5130573. Archived (PDF) from the original on 2021-01-26. Retrieved 2021-01-08.
Brazil, M; Zachariasen, M (2015). "Steiner Trees in Graphs and Hypergraphs". Optimal Interconnection Trees in the Plane. Algorithms and Combinatorics. Vol. 29. Springer. pp. 301–317. doi:10.1007/978-3-319-13915-9_5. ISBN 978-3-319-13915-9. Archived from the original on 2021-01-29. Retrieved 2021-01-20.
Ghoshal, Gourab; Zlatic, Vinko; Caldarelli, Guido; Newman, Mark E.J. (2009), "Random Hypergraphs and their applications", Physical Review E, 79 (6) 066118, arXiv:0903.0419, Bibcode:2009PhRvE..79f6118G, doi:10.1103/PhysRevE.79.066118, PMID 19658575, S2CID 6391099
Tan, Shulong; Bu, Jiajun; Chen, Chun; Xu, Bin; Wang, Can; He, Xiaofei (October 2011), "Using rich social media information for music recommendation via hypergraph model", ACM Transactions on Multimedia Computing, Communications, and Applications, 7S (1), Article 22, Bibcode:2011smma.book..213T, doi:10.1145/2037676.2037679, S2CID 432036
Liu, Qingshan; Huang, Yuchi; Metaxas, Dimitris N. (2013), "Hypergraph with sampling for image retrieval", Pattern Recognition, 44 (10–11): 2255–2262, doi:10.1016/j.patcog.2010.07.014
Patro, Rob; Kingsoford, Carl (2013), "Predicting protein interactions via parsimonious network history inference", Bioinformatics, 29 (10–11): 237–246, doi:10.1093/bioinformatics/btt224, PMC 3694678, PMID 23812989
Gao, Tue; Wang, Meng; Zha, Zheng-Jun; Shen, Jialie; Li, Xuelong; Wu, Xindong (2013), "Visual-textual joint relevance learning for tag-based social image search", IEEE Transactions on Image Processing, 22 (1): 363–376, Bibcode:2013ITIP...22..363Y, doi:10.1109/tip.2012.2202676, PMID 22692911, S2CID 7432373, archived from the original on 2017-09-23, retrieved 2017-09-22
Tian, Ze; Hwang, TaeHyun; Kuang, Rui (2009), "A hypergraph-based learning algorithm for classifying gene expression and arrayCGH data with prior knowledge", Bioinformatics, 25 (21): 2831–2838, doi:10.1093/bioinformatics/btp467, PMID 19648139
Goldstein, A. (1982). "A Directed Hypergraph Database: A Model for the Local Loop Telephone Plant". Bell System Technical Journal. 61 (9): 2529–54. doi:10.1002/j.1538-7305.1982.tb03439.x. S2CID 11290643.
Ranshous, Stephen; Joslyn, Cliff; Kreyling, Sean; Nowak, Kathleen; Samatova, Nagiza; West, Curtis; Winters, Samuel (2017). Exchange Pattern Mining in the Bitcoin Transaction Directed Hypergraph (PDF). Financial Cryptography and Data Security. Springer. doi:10.1007/978-3-319-70278-0_16. Archived (PDF) from the original on 2021-07-15. Retrieved 2021-01-20.
Ausiello, Giorgio; Laura, Luigi (2017). "Directed hypergraphs: Introduction and fundamental algorithms - A survey". Theoretical Computer Science. 658: 293–306. doi:10.1016/j.tcs.2016.03.016.
Gallo, G.; Longo, G.; Pallottino, S.; Nguyen, S. (1993). "Directed hypergraphs and applications". Discrete Applied Mathematics. 42 (2–3): 177–201. doi:10.1016/0166-218X(93)90045-P.
Eschbach, Thomas; Günther, Wolfgang; Becker, Bernd (2006), "Orthogonal hypergraph drawing for improved visibility" (PDF), Journal of Graph Algorithms and Applications, 10 (2): 141–157, doi:10.7155/jgaa.00122, archived (PDF) from the original on 2011-07-18, retrieved 2010-05-17.
Mäkinen, Erkki (1990), "How to draw a hypergraph", International Journal of Computer Mathematics, 34 (3): 177–185, doi:10.1080/00207169008803875.
Bertault, François; Eades, Peter (2001), "Drawing hypergraphs in the subset standard", Graph Drawing, Lecture Notes in Computer Science, vol. 1984, Springer-Verlag, pp. 45–76, doi:10.1007/3-540-44541-2_15, ISBN 978-3-540-41554-1.
Naheed Anjum, Arafat; Bressan, Stéphane (2017), "Hypergraph Drawing by Force-Directed Placement", Database and Expert Systems Applications, Lecture Notes in Computer Science, vol. 10439, Springer International Publishing, pp. 387–394, doi:10.1007/978-3-319-64471-4_31, ISBN 978-3-319-64470-7.
Kaufmann, Michael; van Kreveld, Marc; Speckmann, Bettina (2009), "Subdivision drawings of hypergraphs", Graph Drawing, Lecture Notes in Computer Science, vol. 5417, Springer-Verlag, pp. 396–407, doi:10.1007/978-3-642-00219-9_39, ISBN 978-3-642-00218-2.
Johnson, David S.; Pollak, H. O. (2006), "Hypergraph planarity and the complexity of drawing Venn diagrams", Journal of Graph Theory, 11 (3): 309–325, doi:10.1002/jgt.3190110306.
Buchin, Kevin; van Kreveld, Marc; Meijer, Henk; Speckmann, Bettina; Verbeek, Kevin (2010), "On planar supports for hypergraphs", Graph Drawing, Lecture Notes in Computer Science, vol. 5849, Springer-Verlag, pp. 345–356, doi:10.1007/978-3-642-11805-0_33, ISBN 978-3-642-11804-3.
Fagin, Ronald (1983-07-01). "Degrees of acyclicity for hypergraphs and relational database schemes". Journal of the ACM. 30 (3): 514–550. doi:10.1145/2402.322390. ISSN 0004-5411.
Katona, G.; Kierstead, H. A. (1999). "Hamiltonian chains in hypergraphs". Journal of Graph Theory. 30 (3): 205–212. doi:10.1002/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O.
Zhao, Y. (2016). "Recent advances on Dirac-type problems for hypergraphs". Recent Trends in Combinatorics. The IMA Volumes in Mathematics and its Applications. Vol. 159. pp. 145–165. arXiv:1508.06170. doi:10.1007/978-3-319-24298-9_6. ISBN 978-3-319-24296-5.
Rödl, V.; Szemerédi, E.; Ruciński, A. (2008). "An approximate Dirac-type theorem for k-uniform hypergraphs". Combinatorica. 28 (2): 229–260. doi:10.1007/s00493-008-2295-z.
Sudakov, B.; Tomon, I. (2022). "The Extremal Number of Tight Cycles". International Mathematics Research Notices. 2022 (13): 9663–9684. arXiv:2009.00528. doi:10.1093/imrn/rnaa396.
Yu, C. T.; Özsoyoğlu, M. Z. (1979). "An algorithm for tree-query membership of a distributed query" (PDF). COMPSAC 79. Proceedings. Computer Software and the IEEE Computer Society's Third International Applications Conference, 1979. pp. 306–312. doi:10.1109/CMPSAC.1979.762509. Archived from the original (PDF) on 2018-09-02. Retrieved 2018-09-02.
Tarjan, R. E.; Yannakakis, M. (1984). "Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs". SIAM Journal on Computing. 13 (3): 566–579. doi:10.1137/0213035.
Fagin, Ronald (1983). "Degrees of Acyclicity for Hypergraphs and Relational Database Schemes". Journal of the ACM. 30 (3): 514–550. doi:10.1145/2402.322390. S2CID 597990.
Karypis, G., Aggarwal, R., Kumar, V., and Shekhar, S. (March 1999), "Multilevel hypergraph partitioning: applications in VLSI domain", IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 7 (1): 69–79, CiteSeerX 10.1.1.553.2367, doi:10.1109/92.748202.{{citation}}: CS1 maint: multiple names: authors list (link)
Hendrickson, B., Kolda, T.G. (2000), "Graph partitioning models for parallel computing", Parallel Computing (Submitted manuscript), 26 (12): 1519–1545, doi:10.1016/S0167-8191(00)00048-X, OSTI 4179, archived from the original on 2021-01-26, retrieved 2018-10-13.{{citation}}: CS1 maint: multiple names: authors list (link)
Catalyurek, U.V.; Aykanat, C. (1999), "Hypergraph-Partitioning Based Decomposition for Parallel Sparse-Matrix Vector Multiplication", IEEE Transactions on Parallel and Distributed Systems, 10 (7): 673–693, Bibcode:1999ITPDS..10..673C, CiteSeerX 10.1.1.67.2498, doi:10.1109/71.780863.
Devlin, Keith (1993). "Chapter 7. Non-Well-Founded Set Theory". The Joy of Sets: Fundamentals of Contemporary Set Theory (2nd ed.). pp. 143–184. doi:10.1007/978-1-4612-0903-4_7.
Bertschinger, Daniel; El Maalouly, Nicolas; Kleist, Linda; Miltzow, Tillmann; Weber, Simon (2025). "The Complexity of Recognizing Geometric Hypergraphs". Innovations in Graph Theory (in French). 2: 157–190. doi:10.5802/igt.9. ISSN 3050-743X.
Assari, Amir; Hosseinzadeh, Narges; Macpherson, Dugald (2023). "Set-homogeneous hypergraphs". Journal of the London Mathematical Society. 108 (5): 1852–1885. doi:10.1112/jlms.12796. ISSN 1469-7750.
Popp, Merten; Schlag, Sebastian; Schulz, Christian; Seemaier, Daniel (2020-10-15), Multilevel Acyclic Hypergraph Partitioning, arXiv, doi:10.48550/arXiv.2002.02962, arXiv:2002.02962, retrieved 2025-11-19
Bushaw, Neal; Kettle, Nathan (November 2011). "Turán Numbers of Multiple Paths and Equibipartite Forests". Combinatorics, Probability and Computing. 20 (6): 837–853. doi:10.1017/S0963548311000460. ISSN 1469-2163.
Pisanski, T.; Boben, M.; Marušič, D.; Orbanić, A.; Graovac, A. (2004-01-28). "The 10-cages and derived configurations". Discrete Mathematics. 275 (1): 265–276. doi:10.1016/S0012-365X(03)00110-9. ISSN 0012-365X.
Parui, Samiron (2024-09-24), On the Incidence matrices of hypergraphs, arXiv, doi:10.48550/arXiv.2409.16055, arXiv:2409.16055, retrieved 2025-11-19

handle.net (Global: 102^nd place; English: 76^th place)

hdl.handle.net

Valdivia, Paola; Buono, Paolo; Plaisant, Catherine; Dufournaud, Nicole; Fekete, Jean-Daniel (2020). "Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization" (PDF). IEEE Transactions on Visualization and Computer Graphics. 26 (1). IEEE: 12. doi:10.1109/TVCG.2019.2933196. eISSN 1941-0506. hdl:11586/518500. ISSN 1077-2626. PMID 31398121. S2CID 199518871. Archived (PDF) from the original on 2021-01-26. Retrieved 2020-09-08.

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Ghoshal, Gourab; Zlatic, Vinko; Caldarelli, Guido; Newman, Mark E.J. (2009), "Random Hypergraphs and their applications", Physical Review E, 79 (6) 066118, arXiv:0903.0419, Bibcode:2009PhRvE..79f6118G, doi:10.1103/PhysRevE.79.066118, PMID 19658575, S2CID 6391099
Tan, Shulong; Bu, Jiajun; Chen, Chun; Xu, Bin; Wang, Can; He, Xiaofei (October 2011), "Using rich social media information for music recommendation via hypergraph model", ACM Transactions on Multimedia Computing, Communications, and Applications, 7S (1), Article 22, Bibcode:2011smma.book..213T, doi:10.1145/2037676.2037679, S2CID 432036
Gao, Tue; Wang, Meng; Zha, Zheng-Jun; Shen, Jialie; Li, Xuelong; Wu, Xindong (2013), "Visual-textual joint relevance learning for tag-based social image search", IEEE Transactions on Image Processing, 22 (1): 363–376, Bibcode:2013ITIP...22..363Y, doi:10.1109/tip.2012.2202676, PMID 22692911, S2CID 7432373, archived from the original on 2017-09-23, retrieved 2017-09-22
Catalyurek, U.V.; Aykanat, C. (1999), "Hypergraph-Partitioning Based Decomposition for Parallel Sparse-Matrix Vector Multiplication", IEEE Transactions on Parallel and Distributed Systems, 10 (7): 673–693, Bibcode:1999ITPDS..10..673C, CiteSeerX 10.1.1.67.2498, doi:10.1109/71.780863.

hypernetx.readthedocs.io (Global: low place; English: low place)

"A Gentle Introduction to Hypergraph Mathematics — HyperNetX 2.4.1 documentation". HyperNetX. 2021. Retrieved 19 November 2025.{{cite web}}: CS1 maint: url-status (link)

ieee.org (Global: 652^nd place; English: 515^th place)

ieeexplore.ieee.org

Zhou, Dengyong; Huang, Jiayuan; Scholkopf, Bernhard (2006), "Learning with hypergraphs: clustering, classification, and embedding", Advances in Neural Information Processing Systems, MIT Press, pp. 1601–8, ISBN 978-0-262-25691-9, archived from the original on 2021-10-22, retrieved 2021-07-24

ifca.ai (Global: low place; English: low place)

fc17.ifca.ai

Ranshous, Stephen; Joslyn, Cliff; Kreyling, Sean; Nowak, Kathleen; Samatova, Nagiza; West, Curtis; Winters, Samuel (2017). Exchange Pattern Mining in the Bitcoin Transaction Directed Hypergraph (PDF). Financial Cryptography and Data Security. Springer. doi:10.1007/978-3-319-70278-0_16. Archived (PDF) from the original on 2021-07-15. Retrieved 2021-01-20.

inria.fr (Global: 4,903^rd place; English: 3,679^th place)

hal.inria.fr

Valdivia, Paola; Buono, Paolo; Plaisant, Catherine; Dufournaud, Nicole; Fekete, Jean-Daniel (2020). "Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization" (PDF). IEEE Transactions on Visualization and Computer Graphics. 26 (1). IEEE: 12. doi:10.1109/TVCG.2019.2933196. eISSN 1941-0506. hdl:11586/518500. ISSN 1077-2626. PMID 31398121. S2CID 199518871. Archived (PDF) from the original on 2021-01-26. Retrieved 2020-09-08.

jgaa.info (Global: low place; English: low place)

Eschbach, Thomas; Günther, Wolfgang; Becker, Bernd (2006), "Orthogonal hypergraph drawing for improved visibility" (PDF), Journal of Graph Algorithms and Applications, 10 (2): 141–157, doi:10.7155/jgaa.00122, archived (PDF) from the original on 2011-07-18, retrieved 2010-05-17.

nih.gov (Global: 4^th place; English: 4^th place)

pubmed.ncbi.nlm.nih.gov

Valdivia, Paola; Buono, Paolo; Plaisant, Catherine; Dufournaud, Nicole; Fekete, Jean-Daniel (2020). "Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization" (PDF). IEEE Transactions on Visualization and Computer Graphics. 26 (1). IEEE: 12. doi:10.1109/TVCG.2019.2933196. eISSN 1941-0506. hdl:11586/518500. ISSN 1077-2626. PMID 31398121. S2CID 199518871. Archived (PDF) from the original on 2021-01-26. Retrieved 2020-09-08.
Ghoshal, Gourab; Zlatic, Vinko; Caldarelli, Guido; Newman, Mark E.J. (2009), "Random Hypergraphs and their applications", Physical Review E, 79 (6) 066118, arXiv:0903.0419, Bibcode:2009PhRvE..79f6118G, doi:10.1103/PhysRevE.79.066118, PMID 19658575, S2CID 6391099
Patro, Rob; Kingsoford, Carl (2013), "Predicting protein interactions via parsimonious network history inference", Bioinformatics, 29 (10–11): 237–246, doi:10.1093/bioinformatics/btt224, PMC 3694678, PMID 23812989
Gao, Tue; Wang, Meng; Zha, Zheng-Jun; Shen, Jialie; Li, Xuelong; Wu, Xindong (2013), "Visual-textual joint relevance learning for tag-based social image search", IEEE Transactions on Image Processing, 22 (1): 363–376, Bibcode:2013ITIP...22..363Y, doi:10.1109/tip.2012.2202676, PMID 22692911, S2CID 7432373, archived from the original on 2017-09-23, retrieved 2017-09-22
Tian, Ze; Hwang, TaeHyun; Kuang, Rui (2009), "A hypergraph-based learning algorithm for classifying gene expression and arrayCGH data with prior knowledge", Bioinformatics, 25 (21): 2831–2838, doi:10.1093/bioinformatics/btp467, PMID 19648139

ncbi.nlm.nih.gov

Patro, Rob; Kingsoford, Carl (2013), "Predicting protein interactions via parsimonious network history inference", Bioinformatics, 29 (10–11): 237–246, doi:10.1093/bioinformatics/btt224, PMC 3694678, PMID 23812989

opencog.org (Global: low place; English: low place)

blog.opencog.org

Vepstas, Linas (2013-03-24). "Why Hypergraphs?". OpenCog Brainwave. Retrieved 2025-11-19.

osti.gov (Global: 2,036^th place; English: 1,254^th place)

Hendrickson, B., Kolda, T.G. (2000), "Graph partitioning models for parallel computing", Parallel Computing (Submitted manuscript), 26 (12): 1519–1545, doi:10.1016/S0167-8191(00)00048-X, OSTI 4179, archived from the original on 2021-01-26, retrieved 2018-10-13.{{citation}}: CS1 maint: multiple names: authors list (link)

psu.edu (Global: 207^th place; English: 136^th place)

citeseerx.ist.psu.edu

Karypis, G., Aggarwal, R., Kumar, V., and Shekhar, S. (March 1999), "Multilevel hypergraph partitioning: applications in VLSI domain", IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 7 (1): 69–79, CiteSeerX 10.1.1.553.2367, doi:10.1109/92.748202.{{citation}}: CS1 maint: multiple names: authors list (link)
Catalyurek, U.V.; Aykanat, C. (1999), "Hypergraph-Partitioning Based Decomposition for Parallel Sparse-Matrix Vector Multiplication", IEEE Transactions on Parallel and Distributed Systems, 10 (7): 673–693, Bibcode:1999ITPDS..10..673C, CiteSeerX 10.1.1.67.2498, doi:10.1109/71.780863.

researchgate.net (Global: 120^th place; English: 125^th place)

Tan, Shulong; Bu, Jiajun; Chen, Chun; Xu, Bin; Wang, Can; He, Xiaofei (October 2011), "Using rich social media information for music recommendation via hypergraph model", ACM Transactions on Multimedia Computing, Communications, and Applications, 7S (1), Article 22, Bibcode:2011smma.book..213T, doi:10.1145/2037676.2037679, S2CID 432036

ruizhang.info (Global: low place; English: low place)

Huang, Jin; Zhang, Rui; Yu, Jeffrey Xu (2015). "Scalable Hypergraph Learning and Processing". 2015 IEEE International Conference on Data Mining (PDF). pp. 775–780. doi:10.1109/ICDM.2015.33. ISBN 978-1-4673-9504-5. S2CID 5130573. Archived (PDF) from the original on 2021-01-26. Retrieved 2021-01-08.

sciencedirect.com (Global: 149^th place; English: 178^th place)

Pisanski, T.; Boben, M.; Marušič, D.; Orbanić, A.; Graovac, A. (2004-01-28). "The 10-cages and derived configurations". Discrete Mathematics. 275 (1): 265–276. doi:10.1016/S0012-365X(03)00110-9. ISSN 0012-365X.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Valdivia, Paola; Buono, Paolo; Plaisant, Catherine; Dufournaud, Nicole; Fekete, Jean-Daniel (2020). "Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization" (PDF). IEEE Transactions on Visualization and Computer Graphics. 26 (1). IEEE: 12. doi:10.1109/TVCG.2019.2933196. eISSN 1941-0506. hdl:11586/518500. ISSN 1077-2626. PMID 31398121. S2CID 199518871. Archived (PDF) from the original on 2021-01-26. Retrieved 2020-09-08.
Beeri, C.; Fagin, R.; Maier, D.; Yannakakis, M. (1983). "On the Desirability of Acyclic Database Schemes" (PDF). Journal of the ACM. 30 (3): 479–513. doi:10.1145/2402.322389. S2CID 2418740. Archived (PDF) from the original on 2021-04-21. Retrieved 2021-01-03.
Huang, Jin; Zhang, Rui; Yu, Jeffrey Xu (2015). "Scalable Hypergraph Learning and Processing". 2015 IEEE International Conference on Data Mining (PDF). pp. 775–780. doi:10.1109/ICDM.2015.33. ISBN 978-1-4673-9504-5. S2CID 5130573. Archived (PDF) from the original on 2021-01-26. Retrieved 2021-01-08.
Ghoshal, Gourab; Zlatic, Vinko; Caldarelli, Guido; Newman, Mark E.J. (2009), "Random Hypergraphs and their applications", Physical Review E, 79 (6) 066118, arXiv:0903.0419, Bibcode:2009PhRvE..79f6118G, doi:10.1103/PhysRevE.79.066118, PMID 19658575, S2CID 6391099
Tan, Shulong; Bu, Jiajun; Chen, Chun; Xu, Bin; Wang, Can; He, Xiaofei (October 2011), "Using rich social media information for music recommendation via hypergraph model", ACM Transactions on Multimedia Computing, Communications, and Applications, 7S (1), Article 22, Bibcode:2011smma.book..213T, doi:10.1145/2037676.2037679, S2CID 432036
Gao, Tue; Wang, Meng; Zha, Zheng-Jun; Shen, Jialie; Li, Xuelong; Wu, Xindong (2013), "Visual-textual joint relevance learning for tag-based social image search", IEEE Transactions on Image Processing, 22 (1): 363–376, Bibcode:2013ITIP...22..363Y, doi:10.1109/tip.2012.2202676, PMID 22692911, S2CID 7432373, archived from the original on 2017-09-23, retrieved 2017-09-22
Goldstein, A. (1982). "A Directed Hypergraph Database: A Model for the Local Loop Telephone Plant". Bell System Technical Journal. 61 (9): 2529–54. doi:10.1002/j.1538-7305.1982.tb03439.x. S2CID 11290643.
Fagin, Ronald (1983). "Degrees of Acyclicity for Hypergraphs and Relational Database Schemes". Journal of the ACM. 30 (3): 514–550. doi:10.1145/2402.322390. S2CID 597990.

smu.edu.sg (Global: low place; English: low place)

ink.library.smu.edu.sg

Gao, Tue; Wang, Meng; Zha, Zheng-Jun; Shen, Jialie; Li, Xuelong; Wu, Xindong (2013), "Visual-textual joint relevance learning for tag-based social image search", IEEE Transactions on Image Processing, 22 (1): 363–376, Bibcode:2013ITIP...22..363Y, doi:10.1109/tip.2012.2202676, PMID 22692911, S2CID 7432373, archived from the original on 2017-09-23, retrieved 2017-09-22

springer.com (Global: 274^th place; English: 309^th place)

link.springer.com

Brazil, M; Zachariasen, M (2015). "Steiner Trees in Graphs and Hypergraphs". Optimal Interconnection Trees in the Plane. Algorithms and Combinatorics. Vol. 29. Springer. pp. 301–317. doi:10.1007/978-3-319-13915-9_5. ISBN 978-3-319-13915-9. Archived from the original on 2021-01-29. Retrieved 2021-01-20.

troy.edu (Global: low place; English: low place)

spectrum.troy.edu

"Vitaly Voloshin: Mixed Hypergraph Coloring Website". spectrum.troy.edu. Archived from the original on 2022-01-20. Retrieved 2022-04-27.

uni-koeln.de (Global: 2,455^th place; English: 3,121^st place)

gdea.informatik.uni-koeln.de

Sander, G. (2003), "Layout of directed hypergraphs with orthogonal hyperedges", Proc. 11th International Symposium on Graph Drawing (GD 2003), Lecture Notes in Computer Science, vol. 2912, Springer, pp. 381–6, ISBN 978-3-540-24595-7, archived from the original on 2011-07-18, retrieved 2010-05-17.

unl.edu (Global: 1,708^th place; English: 1,051^st place)

cse.unl.edu

Beeri, C.; Fagin, R.; Maier, D.; Yannakakis, M. (1983). "On the Desirability of Acyclic Database Schemes" (PDF). Journal of the ACM. 30 (3): 479–513. doi:10.1145/2402.322389. S2CID 2418740. Archived (PDF) from the original on 2021-04-21. Retrieved 2021-01-03.

unt.edu (Global: 1,336^th place; English: 769^th place)

digital.library.unt.edu

Hendrickson, B., Kolda, T.G. (2000), "Graph partitioning models for parallel computing", Parallel Computing (Submitted manuscript), 26 (12): 1519–1545, doi:10.1016/S0167-8191(00)00048-X, OSTI 4179, archived from the original on 2021-01-26, retrieved 2018-10-13.{{citation}}: CS1 maint: multiple names: authors list (link)

web.archive.org (Global: 1^st place; English: 1^st place)

Valdivia, Paola; Buono, Paolo; Plaisant, Catherine; Dufournaud, Nicole; Fekete, Jean-Daniel (2020). "Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization" (PDF). IEEE Transactions on Visualization and Computer Graphics. 26 (1). IEEE: 12. doi:10.1109/TVCG.2019.2933196. eISSN 1941-0506. hdl:11586/518500. ISSN 1077-2626. PMID 31398121. S2CID 199518871. Archived (PDF) from the original on 2021-01-26. Retrieved 2020-09-08.
Pearl, Judea (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Company. p. 25. ISBN 978-0-201-05594-8. Archived from the original on 2023-02-04. Retrieved 2021-06-12.
Beeri, C.; Fagin, R.; Maier, D.; Yannakakis, M. (1983). "On the Desirability of Acyclic Database Schemes" (PDF). Journal of the ACM. 30 (3): 479–513. doi:10.1145/2402.322389. S2CID 2418740. Archived (PDF) from the original on 2021-04-21. Retrieved 2021-01-03.
Huang, Jin; Zhang, Rui; Yu, Jeffrey Xu (2015). "Scalable Hypergraph Learning and Processing". 2015 IEEE International Conference on Data Mining (PDF). pp. 775–780. doi:10.1109/ICDM.2015.33. ISBN 978-1-4673-9504-5. S2CID 5130573. Archived (PDF) from the original on 2021-01-26. Retrieved 2021-01-08.
Brazil, M; Zachariasen, M (2015). "Steiner Trees in Graphs and Hypergraphs". Optimal Interconnection Trees in the Plane. Algorithms and Combinatorics. Vol. 29. Springer. pp. 301–317. doi:10.1007/978-3-319-13915-9_5. ISBN 978-3-319-13915-9. Archived from the original on 2021-01-29. Retrieved 2021-01-20.
Zhou, Dengyong; Huang, Jiayuan; Scholkopf, Bernhard (2006), "Learning with hypergraphs: clustering, classification, and embedding", Advances in Neural Information Processing Systems, MIT Press, pp. 1601–8, ISBN 978-0-262-25691-9, archived from the original on 2021-10-22, retrieved 2021-07-24
Gao, Tue; Wang, Meng; Zha, Zheng-Jun; Shen, Jialie; Li, Xuelong; Wu, Xindong (2013), "Visual-textual joint relevance learning for tag-based social image search", IEEE Transactions on Image Processing, 22 (1): 363–376, Bibcode:2013ITIP...22..363Y, doi:10.1109/tip.2012.2202676, PMID 22692911, S2CID 7432373, archived from the original on 2017-09-23, retrieved 2017-09-22
Ranshous, Stephen; Joslyn, Cliff; Kreyling, Sean; Nowak, Kathleen; Samatova, Nagiza; West, Curtis; Winters, Samuel (2017). Exchange Pattern Mining in the Bitcoin Transaction Directed Hypergraph (PDF). Financial Cryptography and Data Security. Springer. doi:10.1007/978-3-319-70278-0_16. Archived (PDF) from the original on 2021-07-15. Retrieved 2021-01-20.
Sander, G. (2003), "Layout of directed hypergraphs with orthogonal hyperedges", Proc. 11th International Symposium on Graph Drawing (GD 2003), Lecture Notes in Computer Science, vol. 2912, Springer, pp. 381–6, ISBN 978-3-540-24595-7, archived from the original on 2011-07-18, retrieved 2010-05-17.
Eschbach, Thomas; Günther, Wolfgang; Becker, Bernd (2006), "Orthogonal hypergraph drawing for improved visibility" (PDF), Journal of Graph Algorithms and Applications, 10 (2): 141–157, doi:10.7155/jgaa.00122, archived (PDF) from the original on 2011-07-18, retrieved 2010-05-17.
"Vitaly Voloshin: Mixed Hypergraph Coloring Website". spectrum.troy.edu. Archived from the original on 2022-01-20. Retrieved 2022-04-27.
Yu, C. T.; Özsoyoğlu, M. Z. (1979). "An algorithm for tree-query membership of a distributed query" (PDF). COMPSAC 79. Proceedings. Computer Software and the IEEE Computer Society's Third International Applications Conference, 1979. pp. 306–312. doi:10.1109/CMPSAC.1979.762509. Archived from the original (PDF) on 2018-09-02. Retrieved 2018-09-02.
Harary, F. (2018) [1969]. Graph Theory. CRC Press. p. 172. ISBN 978-0-429-96231-8. Archived from the original on 2023-02-04. Retrieved 2021-06-12. We next state a theorem due to Elayne Dauber whose corollaries describe properties of line-symmetric graphs. Note the obvious but important observation that every line-symmetric graph is line-regular.
Hendrickson, B., Kolda, T.G. (2000), "Graph partitioning models for parallel computing", Parallel Computing (Submitted manuscript), 26 (12): 1519–1545, doi:10.1016/S0167-8191(00)00048-X, OSTI 4179, archived from the original on 2021-01-26, retrieved 2018-10-13.{{citation}}: CS1 maint: multiple names: authors list (link)

wiley.com (Global: 222^nd place; English: 297^th place)

onlinelibrary.wiley.com

Assari, Amir; Hosseinzadeh, Narges; Macpherson, Dugald (2023). "Set-homogeneous hypergraphs". Journal of the London Mathematical Society. 108 (5): 1852–1885. doi:10.1112/jlms.12796. ISSN 1469-7750.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Valdivia, Paola; Buono, Paolo; Plaisant, Catherine; Dufournaud, Nicole; Fekete, Jean-Daniel (2020). "Analyzing Dynamic Hypergraphs with Parallel Aggregated Ordered Hypergraph Visualization" (PDF). IEEE Transactions on Visualization and Computer Graphics. 26 (1). IEEE: 12. doi:10.1109/TVCG.2019.2933196. eISSN 1941-0506. hdl:11586/518500. ISSN 1077-2626. PMID 31398121. S2CID 199518871. Archived (PDF) from the original on 2021-01-26. Retrieved 2020-09-08.
Fagin, Ronald (1983-07-01). "Degrees of acyclicity for hypergraphs and relational database schemes". Journal of the ACM. 30 (3): 514–550. doi:10.1145/2402.322390. ISSN 0004-5411.
Bertschinger, Daniel; El Maalouly, Nicolas; Kleist, Linda; Miltzow, Tillmann; Weber, Simon (2025). "The Complexity of Recognizing Geometric Hypergraphs". Innovations in Graph Theory (in French). 2: 157–190. doi:10.5802/igt.9. ISSN 3050-743X.
Assari, Amir; Hosseinzadeh, Narges; Macpherson, Dugald (2023). "Set-homogeneous hypergraphs". Journal of the London Mathematical Society. 108 (5): 1852–1885. doi:10.1112/jlms.12796. ISSN 1469-7750.
Bushaw, Neal; Kettle, Nathan (November 2011). "Turán Numbers of Multiple Paths and Equibipartite Forests". Combinatorics, Probability and Computing. 20 (6): 837–853. doi:10.1017/S0963548311000460. ISSN 1469-2163.
Pisanski, T.; Boben, M.; Marušič, D.; Orbanić, A.; Graovac, A. (2004-01-28). "The 10-cages and derived configurations". Discrete Mathematics. 275 (1): 265–276. doi:10.1016/S0012-365X(03)00110-9. ISSN 0012-365X.

Hypergraph (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

archive.org (Global: 6th place; English: 6th place)

arxiv.org (Global: 69th place; English: 59th place)

bham.ac.uk (Global: 6,934th place; English: 4,192nd place)

web.mat.bham.ac.uk

books.google.com (Global: 3rd place; English: 3rd place)

cambridge.org (Global: 305th place; English: 264th place)

centre-mersenne.org (Global: low place; English: low place)

igt.centre-mersenne.org

cmu.edu (Global: 1,564th place; English: 1,028th place)

cs.cmu.edu

computer.org (Global: 5,196th place; English: 3,635th place)

doi.org (Global: 2nd place; English: 2nd place)

handle.net (Global: 102nd place; English: 76th place)

hdl.handle.net

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

hypernetx.readthedocs.io (Global: low place; English: low place)

ieee.org (Global: 652nd place; English: 515th place)

ieeexplore.ieee.org

ifca.ai (Global: low place; English: low place)

fc17.ifca.ai

inria.fr (Global: 4,903rd place; English: 3,679th place)

hal.inria.fr

jgaa.info (Global: low place; English: low place)

nih.gov (Global: 4th place; English: 4th place)

pubmed.ncbi.nlm.nih.gov

ncbi.nlm.nih.gov

opencog.org (Global: low place; English: low place)

blog.opencog.org

osti.gov (Global: 2,036th place; English: 1,254th place)

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

researchgate.net (Global: 120th place; English: 125th place)

ruizhang.info (Global: low place; English: low place)

sciencedirect.com (Global: 149th place; English: 178th place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

smu.edu.sg (Global: low place; English: low place)

ink.library.smu.edu.sg

springer.com (Global: 274th place; English: 309th place)

link.springer.com

troy.edu (Global: low place; English: low place)

spectrum.troy.edu

uni-koeln.de (Global: 2,455th place; English: 3,121st place)

gdea.informatik.uni-koeln.de

unl.edu (Global: 1,708th place; English: 1,051st place)

cse.unl.edu

unt.edu (Global: 1,336th place; English: 769th place)

digital.library.unt.edu

web.archive.org (Global: 1st place; English: 1st place)

wiley.com (Global: 222nd place; English: 297th place)

onlinelibrary.wiley.com

worldcat.org (Global: 5th place; English: 5th place)

search.worldcat.org

ams.org (Global: 451^st place; English: 277^th place)

archive.org (Global: 6^th place; English: 6^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

bham.ac.uk (Global: 6,934^th place; English: 4,192^nd place)

books.google.com (Global: 3^rd place; English: 3^rd place)

cambridge.org (Global: 305^th place; English: 264^th place)

cmu.edu (Global: 1,564^th place; English: 1,028^th place)

computer.org (Global: 5,196^th place; English: 3,635^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

handle.net (Global: 102^nd place; English: 76^th place)

harvard.edu (Global: 18^th place; English: 17^th place)

ieee.org (Global: 652^nd place; English: 515^th place)

inria.fr (Global: 4,903^rd place; English: 3,679^th place)

nih.gov (Global: 4^th place; English: 4^th place)

osti.gov (Global: 2,036^th place; English: 1,254^th place)

psu.edu (Global: 207^th place; English: 136^th place)

researchgate.net (Global: 120^th place; English: 125^th place)

sciencedirect.com (Global: 149^th place; English: 178^th place)

semanticscholar.org (Global: 11^th place; English: 8^th place)

springer.com (Global: 274^th place; English: 309^th place)

uni-koeln.de (Global: 2,455^th place; English: 3,121^st place)

unl.edu (Global: 1,708^th place; English: 1,051^st place)

unt.edu (Global: 1,336^th place; English: 769^th place)

web.archive.org (Global: 1^st place; English: 1^st place)

wiley.com (Global: 222^nd place; English: 297^th place)

worldcat.org (Global: 5^th place; English: 5^th place)