Some NP-complete Problems in Graph Theory
description
Transcript of Some NP-complete Problems in Graph Theory
![Page 1: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/1.jpg)
Some NP-complete Problems in Graph Theory
Prof. Sin-Min Lee
![Page 2: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/2.jpg)
Graph Theory
![Page 3: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/3.jpg)
![Page 4: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/4.jpg)
![Page 5: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/5.jpg)
![Page 6: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/6.jpg)
![Page 7: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/7.jpg)
![Page 8: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/8.jpg)
![Page 9: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/9.jpg)
![Page 10: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/10.jpg)
![Page 11: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/11.jpg)
![Page 12: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/12.jpg)
![Page 13: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/13.jpg)
![Page 14: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/14.jpg)
![Page 15: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/15.jpg)
![Page 16: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/16.jpg)
•An independent set is a subset S of the verticies of the graph, with no elements of S connected by an arc of the graph.
![Page 17: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/17.jpg)
![Page 18: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/18.jpg)
![Page 19: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/19.jpg)
Coloring
• How do you assign a color to each vertex so that adjacent vertices are colored differently?
• Chromatic number of certain types of graphs.• k-Coloring is NP Complete.• Edge coloring
![Page 20: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/20.jpg)
![Page 21: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/21.jpg)
![Page 22: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/22.jpg)
![Page 23: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/23.jpg)
![Page 24: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/24.jpg)
![Page 25: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/25.jpg)
![Page 26: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/26.jpg)
![Page 27: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/27.jpg)
![Page 28: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/28.jpg)
Planarity and Embeddings
K4 is planar
K5 is not
Euler’s formulaKuratowski’s theoremPlanarity algorithms
![Page 29: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/29.jpg)
Flows and Matchings
• Meneger’s theorem (separating vertices)• Hall’s theorem (when is there a matching?)• Stable matchings• Various extensions and similar problems• Algorithms
st5
3
6
1
72
4
9
3
1 5
girls boys
BB: III – maybe two weeks?
AG: CH. 4 and 5.
![Page 30: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/30.jpg)
Random Graphs
• Form probability spaces containing graphs or sequences of graphs as points.
• Simple properties of almost all graphs.
• Phase transition: as you add edges component size jumps from log(n) to cn.
![Page 31: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/31.jpg)
Algebraic Graph Theory
• Cayley diagrams
• Adjacency and Laplacian Matrices their eigenvalues and the structure of various classes of graphs
1 a
a2a3
a
a
a
a
groupelements
generators
![Page 32: Some NP-complete Problems in Graph Theory](https://reader036.fdocuments.us/reader036/viewer/2022062315/568150a7550346895dbeb0b6/html5/thumbnails/32.jpg)
Algorithms• DFS, BFS, Dijkstra’s Algorithm...• Maximal Spanning Tree...• Planarity testing, drawing...• Max flow...• Finding matchings...• Finding paths and circuits...• Traveling salesperson algorithms...• Coloring algorithms...