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

Source URL: eclectic.ss.uci.edu

• Graph theory
• Graph
• Directed graph
• Connectivity
• Social network analysis software

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

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

• Graph theory
• Mathematics
• NP-complete problems
• Graph operations
• Graph coloring
• Line graph
• Matching
• Two-graph
• Train track map

Race Detection in Two Dimensions Dimitar Dimitrov Martin Vechev Vivek Sarkar

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

• Graph theory
• Planar graphs
• Graph connectivity
• Series-parallel graph
• Graph
• Reachability
• Lattice graph
• Topological sorting
• Trapezoid graph

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

Source URL: users.ece.utexas.edu

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

Source URL: iti.mff.cuni.cz

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

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

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

Source URL: thales.math.uqam.ca

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

Source URL: www.jsbi.org

• Graph theory
• Graph operations
• Tree
• Graph
• Graph coloring
• Cograph
• Two-graph
• BassSerre theory

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,

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

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

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

• NP-complete problems
• Graph
• Graph theory
• Matching
• Cycle
• Hamiltonian path
• Spanning tree