Hypergraph

Results: 211



#Item
1The size of a hypergraph and its matching number Hao Huang∗ Po-Shen Loh†  Benny Sudakov‡

The size of a hypergraph and its matching number Hao Huang∗ Po-Shen Loh† Benny Sudakov‡

Add to Reading List

Source URL: www.math.cmu.edu

Language: English - Date: 2011-09-14 20:18:34
    2Recommended Reading  Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning  U.V. C

    Recommended Reading Efficient Parallel Sparse Matrix–Vector Multiplication Using Graph and Hypergraph Partitioning U.V. C

    Add to Reading List

    Source URL: www.doc.ic.ac.uk

    Language: English - Date: 2015-02-25 09:48:50
      3Graph and hypergraph 
oloring Mi
hael Krivelevi
h 1. Basi
 denitions: vertex 
oloring, 
hromati
 number, edge 
oloring, 
hromati
 index. Coloring innite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and 
olorings.

      Graph and hypergraph oloring Mi hael Krivelevi h 1. Basi de nitions: vertex oloring, hromati number, edge oloring, hromati index. Coloring in nite graphs, De Brujin-Erd}os theorem 2. Vertex degrees and olorings.

      Add to Reading List

      Source URL: www.math.tau.ac.il

      Language: English - Date: 2015-10-04 05:22:49
        4A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution Emili Sapena∗ Universitat Polit`ecnica de Catalunya  Llu´ıs Padro´ ∗∗

        A Constraint-Based Hypergraph Partitioning Approach to Coreference Resolution Emili Sapena∗ Universitat Polit`ecnica de Catalunya Llu´ıs Padro´ ∗∗

        Add to Reading List

        Source URL: nlp.lsi.upc.edu

        Language: English - Date: 2013-12-09 09:23:15
          5Technical Report  BU-CE-1201 Hypergraph-Partitioning-Based Models and Methods for Exploiting Cache Locality in Sparse-Matrix Vector Multiplication Kadir Akbudak, Enver Kayaaslan and Cevdet Aykanat

          Technical Report BU-CE-1201 Hypergraph-Partitioning-Based Models and Methods for Exploiting Cache Locality in Sparse-Matrix Vector Multiplication Kadir Akbudak, Enver Kayaaslan and Cevdet Aykanat

          Add to Reading List

          Source URL: www.cs.bilkent.edu.tr

          Language: English - Date: 2012-11-26 09:52:29
            6NUMERICAL SOLUTION of MARKOV CHAINS, p. 1–22  Hypergraph-based Parallel Computation of Passage Time Densities in Large Semi-Markov Models ∗

            NUMERICAL SOLUTION of MARKOV CHAINS, p. 1–22 Hypergraph-based Parallel Computation of Passage Time Densities in Large Semi-Markov Models ∗

            Add to Reading List

            Source URL: www.doc.ic.ac.uk

            Language: English - Date: 2003-12-07 19:02:49
              7ON ALMOST OPTIMAL UNIVERSAL HYPERGRAPHS  arXiv:1509.03983v3 [math.CO] 13 May 2016 SAMUEL HETTERICH, OLAF PARCZYK AND YURY PERSON Abstract. A hypergraph H is called universal for a family F of hypergraphs, if it contains

              ON ALMOST OPTIMAL UNIVERSAL HYPERGRAPHS arXiv:1509.03983v3 [math.CO] 13 May 2016 SAMUEL HETTERICH, OLAF PARCZYK AND YURY PERSON Abstract. A hypergraph H is called universal for a family F of hypergraphs, if it contains

              Add to Reading List

              Source URL: arxiv.org

              - Date: 2016-05-16 02:35:48
                8HYDRA: HYpergraph-based Distributed Response-time Analyser Nicholas J. Dingle∗ Peter G. Harrison

                HYDRA: HYpergraph-based Distributed Response-time Analyser Nicholas J. Dingle∗ Peter G. Harrison

                Add to Reading List

                Source URL: pubs.doc.ic.ac.uk

                - Date: 2007-03-24 10:25:21
                  9Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang†  Abstract

                  Finding Four-Node Subgraphs in Triangle Time Virginia Vassilevska Williams∗ Joshua R. Wang† Abstract

                  Add to Reading List

                  Source URL: web.stanford.edu

                  Language: English - Date: 2014-12-26 02:45:42
                  10Aydın Buluc¸ C ONTACT I NFORMATION Lawrence Berkeley National Laboratory. Mailstop 59R4104

                  Aydın Buluc¸ C ONTACT I NFORMATION Lawrence Berkeley National Laboratory. Mailstop 59R4104

                  Add to Reading List

                  Source URL: gauss.cs.ucsb.edu

                  Language: English - Date: 2016-04-13 03:04:20