Hypergraph (English Wikipedia)

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

refsWebsite

Global rank English rank

30doi.org

2^nd place

15web.archive.org

1^st place

8semanticscholar.org

11^th place

8^th place

6nih.gov

4^th place

3harvard.edu

18^th place

17^th place

2worldcat.org

5^th place

2ams.org

451^st place

277^th place

2books.google.com

3^rd place

2ieee.org

652^nd place

515^th place

2psu.edu

207^th place

136^th place

1inria.fr

4,903^rd place

3,679^th place

1unl.edu

1,708^th place

1,051^st place

1ruizhang.info

low place

1springer.com

274^th place

309^th place

1arxiv.org

69^th place

59^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

1computer.org

5,196^th place

3,635^th place

1unt.edu

1,336^th place

769^th place

ams.org

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

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

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

books.google.com

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.

computer.org

Yu, C. T.; Özsoyoğlu, M. Z. (1979). "An algorithm for tree-query membership of a distributed query" (PDF). Proc. IEEE COMPSAC: 306–312. doi:10.1109/CMPSAC.1979.762509. Archived (PDF) from the original on 2018-09-02. Retrieved 2018-09-02.

doi.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. 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. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE. pp. 497–508. doi:10.1109/FOCS.2006.78. Archived from the original on 2021-01-27. Retrieved 2021-01-20.
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.
Yu, C. T.; Özsoyoğlu, M. Z. (1979). "An algorithm for tree-query membership of a distributed query" (PDF). Proc. IEEE COMPSAC: 306–312. doi:10.1109/CMPSAC.1979.762509. Archived (PDF) from the original 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, 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, CiteSeerX 10.1.1.67.2498, doi:10.1109/71.780863.

harvard.edu

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

ieee.org

ieeexplore.ieee.org

Feige, Uriel; Kim, Jeong Han; Ofek, Eran (2006). Witnesses for non-satisfiability of dense random 3CNF formulas. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE. pp. 497–508. doi:10.1109/FOCS.2006.78. Archived from the original on 2021-01-27. 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 9780262256919, archived from the original on 2021-10-22, retrieved 2021-07-24

ifca.ai

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

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. ISSN 1077-2626. PMID 31398121. S2CID 199518871. Archived (PDF) from the original on 2021-01-26. Retrieved 2020-09-08.

jgaa.info

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

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. 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

psu.edu

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, CiteSeerX 10.1.1.67.2498, doi:10.1109/71.780863.

researchgate.net

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

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.

semanticscholar.org

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. 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

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

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

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

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

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

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, archived from the original on 2021-01-26, retrieved 2018-10-13.{{citation}}: CS1 maint: multiple names: authors list (link)

web.archive.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. 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.
Feige, Uriel; Kim, Jeong Han; Ofek, Eran (2006). Witnesses for non-satisfiability of dense random 3CNF formulas. 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06). IEEE. pp. 497–508. doi:10.1109/FOCS.2006.78. Archived from the original on 2021-01-27. Retrieved 2021-01-20.
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 9780262256919, 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). Proc. IEEE COMPSAC: 306–312. doi:10.1109/CMPSAC.1979.762509. Archived (PDF) from the original 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, archived from the original on 2021-01-26, retrieved 2018-10-13.{{citation}}: CS1 maint: multiple names: authors list (link)

worldcat.org

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. 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.