Pursuit evasion on infinite graphs Florian Lehner∗ January 11, 2016 The cop-and-robber game is a game between two players, where one tries to catch the other by moving along the edges of a graph. It is well known

Source URL: www.florian-lehner.net

Airy Phenomena and Analytic Combinatorics of Connected Graphs Philippe Flajolet Algorithms Project, INRIA Rocquencourt, 78153 Le Chesnay (France). .

Source URL: algo.inria.fr

Open Graphs and Computational Reasoning Lucas Dixon Ross Duncan, Aleks Kissinger University of Edinburgh

Source URL: personal.strath.ac.uk

The square root phenomenon in planar graphs Dániel Marx1 1 Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI) Budapest, Hungary

Source URL: www.cs.bme.hu

SRC Technical NoteApril 15, 1998 Improved Low-Density Parity-Check Codes Using Irregular Graphs and Belief Propagation

Source URL: www.eecs.harvard.edu

• Error detection and correction
• Coding theory
• Discrete mathematics
• Mathematics
• Graph theory
• Low-density parity-check code
• Belief propagation
• Bipartite graph
• Expander code
• Error correction code
• Turbo code
• Linear code

Judicious partitions of directed graphs Choongbum Lee ∗ Po-Shen Loh

Source URL: www.math.cmu.edu

Sum Multicoloring of Graphs Amotz Bar-Noy Magnus M. Halldorssony Guy Kortsarzz Ravit Salmanx

Source URL: crab.rutgers.edu

Speed of light (solution) E1 In this document decimal comma is used instead of decimal point in graphs and tables

Source URL: www.ipho.org

Towards Characterizing Strict Outerconfluent Graphs Fabian Klute and Martin N¨ollenburg Algorithms and Complexity Group, TU Wien, Vienna, Austria Confluent drawings of graphs are geometric representations in the plane,

Source URL: www.ac.tuwien.ac.at