Distributed Parallel Inference on Large Factor Graphs Joseph E. Gonzalez Carnegie Mellon University

Source URL: select.cs.cmu.edu

• Graphical models
• NP-complete problems
• Coding theory
• Belief propagation
• Probability theory
• Factor graph
• Graph partition
• Ear decomposition
• Distributed computing
• Matching
• Graph coloring
• RochaThatte cycle detection algorithm

Graphs of Functions Linear Linear f (x)  

Source URL: sradai.tripod.com

COMPLEXITY OF SIMPLICIAL HOMOLOGY AND INDEPENDENCE COMPLEXES OF CHORDAL GRAPHS MICHAL ADAMASZEK AND JURAJ STACHO Abstract. We prove the NP-hardness of computing homology groups of simplicial complexes when the size of th

Source URL: www.mimuw.edu.pl

Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs ∗ L´aszl´o Babai †

Source URL: page.mi.fu-berlin.de

Neutrosophic Graphs: A New Dimension to Graph Theory W. B. Vasantha Kandasamy Ilanthenral K

Source URL: fs.gallup.unm.edu

Inferring Coarse Views of Connectivity in Very Large Graphs Reza Motamedi Reza Rejaie

Source URL: mirage.cs.uoregon.edu

On the Minimum Degree of Minimal Ramsey Graphs Philipp Zumstein ETH Z¨ urich

Source URL: page.mi.fu-berlin.de

Internat. Math. Nachrichten Nr), 1–24 Random Graphs: Theory and Applications from Nature to Society to the Brain

Source URL: www.math.tugraz.at

Extremal problems for transversals in graphs with bounded degree Tibor Szab´o ∗ G´abor Tardos

Source URL: page.mi.fu-berlin.de

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

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