Hipergraf (Catalan Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hipergraf" in Catalan language version.

refsWebsite

Global rank Catalan rank

11doi.org

2^nd place

6^th place

4web.archive.org

1^st place

1ibm.com

1,131^st place

971^st place

1troy.edu

low place

1dtic.mil

833^rd place

2,115^th place

1ieee.org

652^nd place

549^th place

1ieeecomputersociety.org

low place

1uni-koeln.de

2,455^th place

3,776^th place

1jgaa.info

low place

doi.org

dx.doi.org

Haussler, David; Welzl, Emo «ε-nets and simplex range queries». Discrete and Computational Geometry, 2, 2, 1987, pàg. 127–151. DOI: 10.1007/BF02187876.
Beeri, Catriel; Fagin, Ronald; Maier, David; Yannakakis, Mihalis «On the Desirability of Acyclic Database Schemes». Journal of the ACM [Nova York], 30, 3, juliol 1983, pàg. 479-513. DOI: 10.1145/2402.322389.
Fagin, Ronald «Degrees of Acyclicity for Hypergraphs and Relational Database Schemes». Journal of the ACM (JACM) [Nova York], 30, 3, juliol 1983, pàg. 514-550. Arxivat de l'original el 2016-06-19. DOI: 10.1145/2402.322390 [Consulta: 1r juliol 2016].
Karypis, G.; Aggarwal, R.; Kumar, V.; Shekhar, S. «Multilevel hypergraph partitioning: applications in VLSI domain». IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 7, 1, 3-1999, pàg. 69–79. DOI: 10.1109/92.748202.
Hendrickson, B.; Kolda, T.G. «Graph partitioning models for parallel computing». Parallel Computing, 26, 12, 2000, pàg. 1519–1545. DOI: 10.1016/S0167-8191(00)00048-X.
Catalyurek, U.V.; Aykanat, C. «Hypergraph-Partitioning Based Decomposition for Parallel Sparse-Matrix Vector Multiplication». IEEE Transactions on Parallel and Distributed Systems. IEEE, 10, 7, 1999, pàg. 673–693. DOI: 10.1109/71.780863.
Mäkinen, Erkki «How to draw a hypergraph». International Journal of Computer Mathematics, 34, 3, 1990, pàg. 177–185. DOI: 10.1080/00207169008803875.
Bertault, François; Eades, Peter «Drawing hypergraphs in the subset standard». Proc. 8th International Symposium on Graph Drawing (GD 2000). Springer-Verlag, 1984, 2001, pàg. 45–76. DOI: 10.1007/3-540-44541-2_15.
Kaufmann, Michael; van Kreveld, Marc; Speckmann, Bettina «Subdivision drawings of hypergraphs». Proc. 16th International Symposium on Graph Drawing (GD 2008). Springer-Verlag, 5417, 2009, pàg. 396–407. DOI: 10.1007/978-3-642-00219-9_39.
Johnson, David S.; Pollak, H. O. «Hypergraph planarity and the complexity of drawing Venn diagrams». Journal of graph theory, 11, 3, 2006, pàg. 309–325. DOI: 10.1002/jgt.3190110306.
Buchin, Kevin; van Kreveld, Marc; Meijer, Henk; Speckmann, Bettina; Verbeek, Kevin «On planar supports for hypergraphs». Proc. 17th International Symposium on Graph Drawing (GD 2009). Springer-Verlag, 5849, 2010, pàg. 345–356. DOI: 10.1007/978-3-642-11805-0_33.

dtic.mil

Harary, Frank. «14. Groups - Symmetric graphs». A: Graph theory. Addison Wesley, 1969, p. 172. ISBN 9780201410334 [Consulta: 1r juliol 2016]. «Theorem 14.12: Every line-symmetric graph with no isolated points is point- symmetric or bipartite.» Arxivat 2017-02-07 a Wayback Machine.

ibm.com

researcher.ibm.com

Fagin, Ronald «Degrees of Acyclicity for Hypergraphs and Relational Database Schemes». Journal of the ACM (JACM) [Nova York], 30, 3, juliol 1983, pàg. 514-550. Arxivat de l'original el 2016-06-19. DOI: 10.1145/2402.322390 [Consulta: 1r juliol 2016].

ieee.org

ieeexplore.ieee.org

Karypis, G.; Aggarwal, R.; Kumar, V.; Shekhar, S. «Multilevel hypergraph partitioning: applications in VLSI domain». IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 7, 1, 3-1999, pàg. 69–79. DOI: 10.1109/92.748202.

ieeecomputersociety.org

doi.ieeecomputersociety.org

Catalyurek, U.V.; Aykanat, C. «Hypergraph-Partitioning Based Decomposition for Parallel Sparse-Matrix Vector Multiplication». IEEE Transactions on Parallel and Distributed Systems. IEEE, 10, 7, 1999, pàg. 673–693. DOI: 10.1109/71.780863.

jgaa.info

Eschbach, Thomas; Günther, Wolfgang; Becker, Bernd «Orthogonal hypergraph drawing for improved visibility». Journal of Graph Algorithms and Applications, 10, 2, 2006, pàg. 141-157. Arxivat de l'original el 2011-07-18 [Consulta: 1r juliol 2016].

troy.edu

spectrum.troy.edu

Voloshin, Vitaly I. «Vitaly Voloshin: Mixed Hypergraph Coloring Website». Troy, Alabama, EUA: Department of Mathematics, Troy University.

uni-koeln.de

gdea.informatik.uni-koeln.de

Sander, G. «Layout of directed hypergraphs with orthogonal hyperedges». Proc. 11th International Symposium on Graph Drawing (GD 2003). Springer-Verlag, 2912, 2003, pàg. 381–386. Arxivat de l'original el 2011-07-18 [Consulta: 1r juliol 2016].

web.archive.org

Fagin, Ronald «Degrees of Acyclicity for Hypergraphs and Relational Database Schemes». Journal of the ACM (JACM) [Nova York], 30, 3, juliol 1983, pàg. 514-550. Arxivat de l'original el 2016-06-19. DOI: 10.1145/2402.322390 [Consulta: 1r juliol 2016].
Harary, Frank. «14. Groups - Symmetric graphs». A: Graph theory. Addison Wesley, 1969, p. 172. ISBN 9780201410334 [Consulta: 1r juliol 2016]. «Theorem 14.12: Every line-symmetric graph with no isolated points is point- symmetric or bipartite.» Arxivat 2017-02-07 a Wayback Machine.
Sander, G. «Layout of directed hypergraphs with orthogonal hyperedges». Proc. 11th International Symposium on Graph Drawing (GD 2003). Springer-Verlag, 2912, 2003, pàg. 381–386. Arxivat de l'original el 2011-07-18 [Consulta: 1r juliol 2016].
Eschbach, Thomas; Günther, Wolfgang; Becker, Bernd «Orthogonal hypergraph drawing for improved visibility». Journal of Graph Algorithms and Applications, 10, 2, 2006, pàg. 141-157. Arxivat de l'original el 2011-07-18 [Consulta: 1r juliol 2016].