Training Factor Graphs with Reinforcement Learning For Efficient MAP Inference Michael Wick, Khashayar Rohanimanesh, Sameer Singh, and Andrew McCallum University of Massachusetts Computer Science Department (IESL) Proba

Source URL: people.cs.umass.edu

QUASIRANDOM CAYLEY GRAPHS DAVID CONLON AND YUFEI ZHAO Abstract. We prove that the properties of having small discrepancy and having small second eigenvalue are equivalent in Cayley graphs, extending a result of Kohayakaw

Source URL: yufeizhao.com

Construction of locally plane graphs with many edges G´abor Tardos∗ R´enyi Institute, Budapest, Hungary and School of Computing Science, Simon Fraser University, Burnaby, BC

Source URL: www.renyi.hu

UPPER TAILS AND INDEPENDENCE POLYNOMIALS IN RANDOM GRAPHS BHASWAR B. BHATTACHARYA, SHIRSHENDU GANGULY, EYAL LUBETZKY, AND YUFEI ZHAO Abstract. The upper tail problem in the Erd˝ os-R´enyi random graph G ∼ Gn,p asks t

Source URL: yufeizhao.com

Connecting Obstacles in Vertex-Disjoint Paths Marwan Al-Jubeh∗ Gill Barequet†∗ Mashhood Ishaque∗

Source URL: www.eecs.tufts.edu

• Graph theory
• Graph connectivity
• Planar graphs
• Graph operations
• Bipartite graphs
• Tree
• Neighbourhood
• Line graph
• Path
• Connectivity
• Graph
• K-edge-connected graph

Random graphs from constrained classes Marc Noy UPC Barcelona ALEA in Europe M¨

Source URL: www.mathematik.uni-muenchen.de

ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 15, 2014 Abstract. Let us fix a function f (n) = o(n ln n) and reals 0 ≤ α < β ≤ 1. We present a polynomial time algorithm which, given a directed graph G

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

• Mathematics
• Permutations
• Linear algebra
• Matrix theory
• Algebra
• Permanent
• Computing the permanent
• Permutation
• Hamiltonian path
• Tournament

Enumeration methods for planar graphs and beyond Mihyun Kang Technische Universität Berlin

Source URL: www.math.tugraz.at

Less is More: Compact Matrix Decomposition for Large Sparse Graphs Jimeng Sun Yinglian Xie Hui Zhang Christos Faloutsos Carnegie Mellon University

Source URL: www.cs.cmu.edu

CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Disjoint Segments have Convex Partitions with 2-Edge Connected Dual Graphs Nadia M. Benbernou∗

Source URL: www.eecs.tufts.edu

• Planar graphs
• Graph connectivity
• Graph operations
• Dual graph
• Line segment
• Cut
• Convex set
• Connectivity
• Graph
• Bridge
• Planar separator theorem
• Circle packing theorem