A phase transition on the evolution of bootstrap percolation processes on preferential attachment graphs Mohammed Amin Abdullah∗‡ Nikolaos Fountoulakis†‡

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

• Graph theory
• Graph coloring
• NP-complete problems
• Incidence coloring

2. Climbing Up The Eiffel Tower as told to Ucaoimhu 50 Don’t be so nervous; my aristocratic demeanor isn’t that intimidating. Anyway, judging from the title,

Source URL: www.math.uchicago.edu

• Leisure
• Gaming
• NP-complete problems
• Crossword
• Puzzles
• Cluedo

BERNSTEIN is NP hard A new representation for geometric sets Fractals and intervals

Source URL: raim2012.u-bourgogne.fr

• Constructible universe
• Operator theory

सरकारी जग्गा दर्ाा र्था लिजमा उपिव्ध गराउने सम्वन्धी कार्ानीतर्, २०७१ नेपाल राजपत

Source URL: www.molrm.gov.np

CS168: The Modern Algorithmic Toolbox Lectures #11 and #12: Spectral Graph Theory Tim Roughgarden & Gregory Valiant∗ May 2, 2016 Spectral graph theory is the powerful and beautiful theory that arises from the following

Source URL: theory.stanford.edu

• Graph theory
• Mathematics
• Algebra
• Algebraic graph theory
• Matrix theory
• Matrices
• NP-complete problems
• Laplacian matrix
• Eigenvalues and eigenvectors
• Regular graph
• Spectral clustering
• Graph partition

>L pk/fi6«kltsf] sfof{no cf=j=@)&@.)&# -df3b]lv r}q d;fGt;Dd_ ;"rgfsf] xs ;DaGwL P]g, @)^$ sf] bkmf % sf] pkbkmf -#_ sf] k|of]hgsf] nflu hf/L ul/Psf] hfgsf/L

Source URL: www.vpn.gov.np

Course Mechanics Inf1CG runs weeks 1–10, with 30 slots: 29 lectures, no lectures in innovative learning week. Language: Introduction

Source URL: www.inf.ed.ac.uk

• Syntax
• Cognitive science
• Grammar
• Complexity classes
• Philosophy of language
• Semiotics
• Phrase
• NP
• P versus NP problem
• Left corner

CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16,

Source URL: theory.stanford.edu

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Spanning tree
• Operations research
• Combinatorial optimization
• NP-hard problems
• Online algorithm
• Steiner tree problem
• Minimum spanning tree
• Travelling salesman problem

Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen

Source URL: people.mpi-inf.mpg.de

• Graph theory
• NP-complete problems
• Combinatorial optimization
• Planar graphs
• Dominating set
• Matching
• Graph coloring
• Maximal independent set

Dynamic Graph Labeling Andreas Kinell Instructors: Regina O’Dell Roger Wattenhofer November 6, 2004

Source URL: disco.ethz.ch

• Graph theory
• NP-complete problems
• Graph
• Graph coloring
• Planar graph
• Dominating set
• Connectivity
• Graph operations
• Planar separator theorem