Two-graph

Results: 168



#Item
41Two types of genealogical networks: p-graph has marriages as nodes and lines as individuals; Ore-graphs have individuals as no

Two types of genealogical networks: p-graph has marriages as nodes and lines as individuals; Ore-graphs have individuals as no

Add to Reading List

Source URL: eclectic.ss.uci.edu

Language: English - Date: 2005-05-21 02:53:54
42COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015

COMPUTING THE PARTITION FUNCTION FOR GRAPH HOMOMORPHISMS WITH MULTIPLICITIES ´n Alexander Barvinok and Pablo Sobero July 2015

Add to Reading List

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

Language: English - Date: 2015-08-02 17:12:20
43Race Detection in Two Dimensions Dimitar Dimitrov Martin Vechev Vivek Sarkar

Race Detection in Two Dimensions Dimitar Dimitrov Martin Vechev Vivek Sarkar

Add to Reading List

Source URL: www.srl.inf.ethz.ch

Language: English - Date: 2015-05-03 19:24:30
44Greedy Learning of Graphical Models with Small Girth Avik Ray, Sujay Sanghavi and Sanjay Shakkottai Abstract— This paper develops two new greedy algorithms for learning the Markov graph of discrete probability distribu

Greedy Learning of Graphical Models with Small Girth Avik Ray, Sujay Sanghavi and Sanjay Shakkottai Abstract— This paper develops two new greedy algorithms for learning the Markov graph of discrete probability distribu

Add to Reading List

Source URL: users.ece.utexas.edu

Language: English - Date: 2012-10-26 11:01:12
    45ON NOWHERE DENSE GRAPHS ˇ RIL ˇ AND PATRICE OSSONA DE MENDEZ JAROSLAV NESET Abstract. A set A of vertices of a graph G is called d-scattered in G if no two dneighborhoods of (distinct) vertices of A intersect. In other

    ON NOWHERE DENSE GRAPHS ˇ RIL ˇ AND PATRICE OSSONA DE MENDEZ JAROSLAV NESET Abstract. A set A of vertices of a graph G is called d-scattered in G if no two dneighborhoods of (distinct) vertices of A intersect. In other

    Add to Reading List

    Source URL: iti.mff.cuni.cz

    Language: English - Date: 2016-02-04 05:53:37
      46What is Ramsey-equivalent to the clique? Anita Liebenau (University of Warwick) A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H 0 are Ramsey-equiv

      What is Ramsey-equivalent to the clique? Anita Liebenau (University of Warwick) A graph G is Ramsey for H if every two-colouring of the edges of G contains a monochromatic copy of H. Two graphs H and H 0 are Ramsey-equiv

      Add to Reading List

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

      Language: English - Date: 2014-01-27 06:10:00
        47CLASSIFICATION OF AUTOMORPHIC CONJUGACY CLASSES IN THE FREE GROUP ON TWO GENERATORS BOBBE COOPER AND ERIC ROWLAND Abstract. We associate a finite directed graph with each equivalence class of words in F2 under Aut F2 , a

        CLASSIFICATION OF AUTOMORPHIC CONJUGACY CLASSES IN THE FREE GROUP ON TWO GENERATORS BOBBE COOPER AND ERIC ROWLAND Abstract. We associate a finite directed graph with each equivalence class of words in F2 under Aut F2 , a

        Add to Reading List

        Source URL: thales.math.uqam.ca

        Language: English - Date: 2014-02-14 05:51:08
          48December 15, :16 WSPC - Proceedings Trim Size: 9.75in x 6.5in

          December 15, :16 WSPC - Proceedings Trim Size: 9.75in x 6.5in

          Add to Reading List

          Source URL: www.jsbi.org

          Language: English - Date: 2008-12-14 21:19:00
          49Publications since 2000 Wolfgang Rump 1. Two-Point Differentiation for General Orders, Journal of Pure and Applied Algebra), Representation theory of two-dimensional Brauer graph rings,

          Publications since 2000 Wolfgang Rump 1. Two-Point Differentiation for General Orders, Journal of Pure and Applied Algebra), Representation theory of two-dimensional Brauer graph rings,

          Add to Reading List

          Source URL: www.iaz.uni-stuttgart.de

          Language: English - Date: 2015-12-29 09:58:45
            50Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany

            Partitioning two-coloured complete multipartite graphs into monochromatic paths and cycles Oliver Schaudt Institut f¨ ur Informatik, Universit¨at zu K¨oln, K¨oln, Germany

            Add to Reading List

            Source URL: www.zaik.uni-koeln.de

            Language: English - Date: 2014-10-02 11:19:31