Packing and Covering Triangles in K4-free Planar Graphs∗ Penny Haxell† Alexandr Kostochka

Source URL: perso.ens-lyon.fr

Introduction Main Part Conclusion Numerical study of spectrum and eigenfunction statistics on disordered random regular graphs

Source URL: intgroup.itp.ac.ru

Dynamic Programming for Graphs on Surfaces∗ Juanjo Ru´e† Ignasi Sau‡ Dimitrios M. Thilikos§

Source URL: www-ma2.upc.edu

Application of Bayesian Graphs to SNIa Data Analysis and Compression based on arXiv: & Cong Ma Purple Mountain Obs. & LUTH, Obs. Paris–Meudon

Source URL: cosmo21.cosmostat.org

Parameterized Complexity of Critical Node Cuts Danny Hermelin1 , Moshe Kaspi1 , Christian Komusiewicz2 , and Barak Navon1 1 2

Source URL: drops.dagstuhl.de

• Graph theory
• Mathematics
• Treewidth
• Clique
• Vertex
• Tree decomposition
• Centrality
• Graph
• Degree
• Pathwidth
• Logic of graphs

Training Factor Graphs with Reinforcement Learning for Efficient MAP Inference Michael Wick, Khashayar Rohanimanesh, Sameer Singh, Andrew McCallum Department of Computer Science University of Massachusetts Amherst

Source URL: people.cs.umass.edu

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

´ AND HAGGKVIST ¨ SOLUTION TO A PROBLEM OF BOLLOBAS ON HAMILTON CYCLES IN REGULAR GRAPHS ¨

Source URL: www.klstaden.site11.com

Two critical periods in the evolution of random planar graphs Mihyun Kang Institut f¨ur Mathematik, MA 6-2, Technische Universit¨at Berlin Straße des 17. Juni 136, 10623 Berlin, Germany

Source URL: www.math.tugraz.at

Path Coding Penalties for Directed Acyclic Graphs Bin Yu∗ Department of Statistics University of California, Berkeley

Source URL: lear.inrialpes.fr