Hypergraph

Results: 211



#Item
31Stopping Times, Metrics and Approximate Counting Magnus Bordewich1, Martin Dyer2 , and Marek Karpinski3 1 3

Stopping Times, Metrics and Approximate Counting Magnus Bordewich1, Martin Dyer2 , and Marek Karpinski3 1 3

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2006-06-15 10:29:31
32Spectral Graph Theory and its Applications September 14, 2004 Lecture 4 Lecturer: Daniel A. Spielman

Spectral Graph Theory and its Applications September 14, 2004 Lecture 4 Lecturer: Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2005-06-30 12:02:45
33Explicit construction of universal structures Jan Hubiˇcka Charles University Prague Joint work with Jarik Nešetˇril

Explicit construction of universal structures Jan Hubiˇcka Charles University Prague Joint work with Jarik Nešetˇril

Add to Reading List

Source URL: www.ucw.cz

Language: English - Date: 2013-11-18 12:05:35
34Clustering Web Images using Association Rules, Interestingness Measures, and Hypergraph Partitions Hassan H. Malik John R. Kender

Clustering Web Images using Association Rules, Interestingness Measures, and Hypergraph Partitions Hassan H. Malik John R. Kender

Add to Reading List

Source URL: www.cs.columbia.edu

Language: English - Date: 2006-05-23 23:37:21
    35HYPERGRAPH MODELS OF PLAYLIST DIALECTS Brian McFee Computer Science and Engineering University of California, San Diego ABSTRACT

    HYPERGRAPH MODELS OF PLAYLIST DIALECTS Brian McFee Computer Science and Engineering University of California, San Diego ABSTRACT

    Add to Reading List

    Source URL: bmcfee.github.io

    Language: English - Date: 2016-05-31 12:44:38
    36JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

    JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek

    Add to Reading List

    Source URL: jmlr.org

    Language: English - Date: 2015-07-20 20:08:36
    37MATCHINGS IN 3-UNIFORM HYPERGRAPHS ¨ DANIELA KUHN, DERYK OSTHUS AND ANDREW TREGLOWN Abstract. We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose tha

    MATCHINGS IN 3-UNIFORM HYPERGRAPHS ¨ DANIELA KUHN, DERYK OSTHUS AND ANDREW TREGLOWN Abstract. We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose tha

    Add to Reading List

    Source URL: web.mat.bham.ac.uk

    Language: English - Date: 2012-11-14 02:23:49
      38COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element

      COMPUTING THE PARTITION FUNCTION FOR PERFECT MATCHINGS IN A HYPERGRAPH Alexander Barvinok and Alex Samorodnitsky September 2011 Abstract. Given non-negative weights wS on the k-subsets S of a km-element

      Add to Reading List

      Source URL: www.math.lsa.umich.edu

      Language: English - Date: 2011-09-04 21:59:49
      39HYPERGRAPH LIMITS: A REGULARITY APPROACH YUFEI ZHAO Abstract. A sequence of k-uniform hypergraphs H1 , H2 , . . . is convergent if the sequence of homomorphism densities t(F, H1 ), t(F, H2 ), . . . converges for every k-

      HYPERGRAPH LIMITS: A REGULARITY APPROACH YUFEI ZHAO Abstract. A sequence of k-uniform hypergraphs H1 , H2 , . . . is convergent if the sequence of homomorphism densities t(F, H1 ), t(F, H2 ), . . . converges for every k-

      Add to Reading List

      Source URL: yufeizhao.com

      Language: English - Date: 2014-04-26 00:37:55
        40Almost all hypergraphs without Fano planes are bipartite∗ Yury Person† Abstract The hypergraph of the Fano plane is the unique 3-uniform hypergraph with 7 triples on 7 vertices in which every pair of vertices is cont

        Almost all hypergraphs without Fano planes are bipartite∗ Yury Person† Abstract The hypergraph of the Fano plane is the unique 3-uniform hypergraph with 7 triples on 7 vertices in which every pair of vertices is cont

        Add to Reading List

        Source URL: www.math.uni-frankfurt.de

        Language: English - Date: 2013-08-01 11:11:37