Network Analysis and Modeling, CSCI 5352 LectureProf. Aaron Clauset

Source URL: tuvalu.santafe.edu

• Network theory
• Graph theory
• Algebraic graph theory
• Networks
• Network analysis
• Modularity
• Community structure
• Clustering coefficient
• Cluster analysis
• Clique
• Graph
• Vertex

JMLR: Workshop and Conference Proceedings vol 40:1–40, 2015 28th Annual Conference on Learning Theory Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems

Source URL: jmlr.org

• Probability distributions
• Clique problem
• Expected value
• Planted clique
• Matrix
• Markov chain
• Normal distribution

doi:j.aml

Source URL: community.dur.ac.uk

• Interval graph
• Chordal graph
• Indifference graph
• Perfect graph
• Independent set
• Circular-arc graph
• Clique
• Interval
• Adjacency matrix
• Graph
• Representation
• Pathwidth

Approximating Visibility Problems within a Constant E. M ARKOU Computer Science, ECE, National Technical University of Athens, Greece C. F RAGOUDAKIS Computer Science, ECE, National Technical University of Athens, Greece

Source URL: emarkou.users.uth.gr

• Polygons
• NP-complete problems
• Computational problems
• Computational geometry
• Combinatorial optimization
• Art gallery problem
• Visibility graph
• Simple polygon
• Clique
• Cut
• Optimization problem
• Polygon covering

Petr Mitrichev Contest 6 http://acm.sgu.ru/, Sunday, December 27, 2009 Problem A. Black-white balls Input file: Output file:

Source URL: acm.sgu.ru

• NP-complete problems
• Clique problem
• Standard streams
• Clique
• P versus NP problem

Recovering Social Network by Observing Votes Ben Fish, Yi Huang, Lev Reyzin Summary Common Neighbor Model

Source URL: www.levreyzin.com

• Graph theory
• Algebraic graph theory
• Bipartite graph
• Parity
• Adjacency matrix
• Vertex
• Clique
• Graph
• Matching
• Neighbourhood
• Line graph

SIAM J. DISCRETE MATH. Vol. 23, No. 4, pp. 1800–1813 c 2009 Society for Industrial and Applied Mathematics 

Source URL: community.dur.ac.uk

• NP-complete problems
• Trapezoid graph
• Graph coloring
• Independent set
• Intersection graph
• Interval graph
• Clique
• Perfect graph
• Pathwidth
• Planar graph

Colouring Graphs When the Number of Colours is Almost the Maximum Degree∗ Michael Molloy Dept of Computer Science, University of Toronto 10 Kings College Rd. Toronto, ON, Canada, M5S 3G4

Source URL: www.cs.toronto.edu

• Graph coloring
• Graph theory
• Graph operations
• Clique
• Degree
• Neighbourhood
• Graph
• Perfect graph theorem
• Extremal graph theory

Clique no nome do canal de atendimento e confira: Internet Fone Fácil

Source URL: www.bradesco.com.br

On the Recognition of Four-Directional Orthogonal Ray Graphs∗ Stefan Felsner1 , George B. Mertzios2 , and Irina Mustat, ˘a1 1 2

Source URL: community.dur.ac.uk

• Graph
• Graph theory
• Ear decomposition
• Clique
• Intersection graph
• Comparability graph
• Orientation
• Line graph
• Interval graph