THEOREM OF THE DAY The Handshaking Lemma In any graph the sum of the vertex degrees is equal to twice the number of edges. The degree of a vertex is the number of edges incident with it (a self-loop joining a vertex to

Source URL: www.theoremoftheday.org

11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing

Source URL: vigna.di.unimi.it

• Scheduling
• Operations research
• NP-complete problems
• Complexity classes
• Combinatorial optimization
• Makespan
• Knapsack problem
• NP
• Algorithm
• Vertex cover
• Approximation algorithm
• Job shop scheduling

Variations on Random Graph Models for the Web Eleni Drinea Mihaela Enachescu Michael Mitzenmacher

Source URL: www.eecs.harvard.edu

• Mathematics
• Graph theory
• Discrete mathematics
• PageRank
• Vertex
• Graph
• Ear decomposition
• Almost surely
• Network science
• Centrality

Vertex colorings of graphs without short odd cycles Andrzej Dudek∗ and Reshma Ramadurai Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213, USA {adudek,rramadur}@andrew.cmu.edu

Source URL: homepages.wmich.edu

Vertex Neighborhoods, Low Conductance Cuts, and Good Seeds for Local Community Methods David F. Gleich∗ C. Seshadhri†

Source URL: www.cs.princeton.edu

• Graph theory
• Mathematics
• Discrete mathematics
• Algebraic graph theory
• Network theory
• Networks
• Network analysis
• Vertex
• Conductance
• Clustering coefficient
• Graph partition
• Neighbourhood

GasCL: A Vertex-Centric Graph Model for GPUs

Source URL: www.ieee-hpec.org

Workshop on vertex operator algebras and mock modular forms Schedule for Friday, MayNicolas Bergeron (Paris 7)

Source URL: mathsci.ucd.ie

THEOREM OF THE DAY Tutte’s Golden Identity Let T be an n-vertex planar triangulation with chromatic polynomial P(T, λ), √
and let ϕ denote 12 1 + 5 , the golden ratio. Then

Source URL: www.theoremoftheday.org

Hardness of Vertex Deletion and Project Scheduling

Source URL: theoryofcomputing.org

On the complexity of vertex-coloring edge-weightings Andrzej Dudek David Wajc∗

Source URL: homepages.wmich.edu