Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · •...
Transcript of Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · •...
![Page 1: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/1.jpg)
Algorithmic Graph Theory
Treewidth
![Page 2: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/2.jpg)
Outline • Tree decomposition - treewidth (tw(G))
• Path decomposition - pathwidth (pw(G))
• partial k-trees
• chordal graphs
• interval graphs
• Connections with tw(G) and pw(G) – chordal graphs and interval graphs
– graph searching
![Page 3: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/3.jpg)
![Page 4: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/4.jpg)
![Page 5: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/5.jpg)
![Page 6: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/6.jpg)
![Page 7: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/7.jpg)
![Page 8: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/8.jpg)
Example
![Page 9: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/9.jpg)
Example
![Page 10: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/10.jpg)
Example
![Page 11: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/11.jpg)
Example
![Page 12: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/12.jpg)
![Page 13: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/13.jpg)
tw(G) = treewidth of G
ω(G) = clique number of G
![Page 14: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/14.jpg)
![Page 15: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/15.jpg)
![Page 16: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/16.jpg)
Example
tw(G) = 2
width(X, T) = 2
![Page 17: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/17.jpg)
![Page 18: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/18.jpg)
Example
![Page 19: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/19.jpg)
Example
pw(G) = 2 (???)
width(X, P) = 3
![Page 20: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/20.jpg)
![Page 21: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/21.jpg)
computing tw(G) and pw(G)
![Page 22: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/22.jpg)
computing tw(G) and pw(G)
![Page 23: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/23.jpg)
k-trees
![Page 24: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/24.jpg)
![Page 25: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/25.jpg)
partial k-trees and tw(G)
Theorem: G is a partial k-tree tw(G) ≤ k
if G is a k-tree then tw(G) ≤ k
partial k-tree k-tree and tw(H) ≤ tw(G) for H G
Induction on |V|: pick v, N(v) = K, K Xi , Xj = K {v}, Xi<-> Xj
if tw(G) ≤ k then G is a partial k-tree
Pick a leaf node Xleaf, Xj <-> Xleaf , such that Xleaf – Xj = {v}
| Xleaf | ≤ k+1: |N(v)| ≤ k and N(v) Xj (since v Xi)
By induction G[Xj] is a clique: N(v) induces a clique
![Page 26: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/26.jpg)
http://www.graphclasses.org/
• tw(G) = 1 G forest,
• tw(G) = 2 G series parallel,
• tw(G) = 3 G partial 3-tree,
• ...
![Page 27: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/27.jpg)
Hasse diagram of subclasses
![Page 28: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/28.jpg)
chordal graphs
![Page 29: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/29.jpg)
chordal graphs
![Page 30: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/30.jpg)
chordal graphs
• Pls., prove Theorem 5.2
![Page 31: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/31.jpg)
simplicial vertices
![Page 32: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/32.jpg)
simplicial vertices
![Page 33: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/33.jpg)
chordal graphs
Pls., prove Lemma
![Page 34: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/34.jpg)
![Page 35: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/35.jpg)
![Page 36: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/36.jpg)
![Page 37: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/37.jpg)
![Page 38: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/38.jpg)
![Page 39: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/39.jpg)
![Page 40: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/40.jpg)
![Page 41: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/41.jpg)
Triangulations
• Triangulation: Any graph G can be turned into a chordal graph by adding edges
• Use the perfect elimination ordering (elimination game): – Choose any vertex x to start with, and add the necessary edges so that
the neighbors of x become a clique.
– Remove x from the modied graph, and continue this process until all vertices are processed
• Filled graph: the resulting graph
• Triangulations can also be computed in other ways: – for example by making every minimal separator into a clique by adding
edges
• Computing a triangulation with the min number of edges: – computing a "nice" ordering β among all of them
– Unfortunately, this is an NP-hard problem
![Page 42: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/42.jpg)
Triangulations
Order: < a, b, c, d, e, f >
added edges: {} , {cf}, {df}, {}, {}, {}
![Page 43: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/43.jpg)
Triangulations
Order: < a, b, c, d, e, f >
added edges: {} , {cf}, {df}, {}, {}, {}
Order: < a, c, d, b, e, f >
added edges: {} , {bd}, {df}, {}, {}, {}
![Page 44: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/44.jpg)
Triangulations
Order: < a, b, c, d, e, f >
added edges: {} , {cf}, {df}, {}, {}, {}
Order: < a, c, d, b, e, f >
added edges: {} , {bd}, {df}, {}, {}, {}
![Page 45: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/45.jpg)
![Page 46: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/46.jpg)
![Page 47: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/47.jpg)
![Page 48: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/48.jpg)
![Page 49: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/49.jpg)
![Page 50: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/50.jpg)
chordal graphs and maximal cliques
![Page 51: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/51.jpg)
chordal graphs and maximal cliques
![Page 52: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/52.jpg)
chordal graphs and maximal cliques
![Page 53: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/53.jpg)
chordal graphs and clique trees
Clique tree T (iii): There exists a tree whose vertex set is the set of maximal cliques of G (each T[Kv] is connected)
• If G is a chordal graph, then any clique tree of G is also a tree decomposition of G (the opposite is not always true)
• Useful structure to express the information on maximal cliques and minimal separators of a chordal graph.
1
2
3 4
![Page 54: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/54.jpg)
clique graph
• (Ci,Cj) E Ci Cj
• w(e)= | Ci Cj |
![Page 55: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/55.jpg)
clique graph and clique tree
• Note that the clique graph of G is unique, whereas G may have several different clique trees
![Page 56: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/56.jpg)
clique graph and clique tree
• number of minimal separators < |V|
![Page 57: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/57.jpg)
connection with Tree Decomposition
![Page 58: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/58.jpg)
![Page 59: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/59.jpg)
![Page 60: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/60.jpg)
![Page 61: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/61.jpg)
clique trees on interval graphs
![Page 62: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/62.jpg)
clique trees on interval graphs
![Page 63: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/63.jpg)
clique trees on interval graphs
![Page 64: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/64.jpg)
clique trees on interval graphs
• Its clique tree = tree decomposition = path decomposition
![Page 65: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/65.jpg)
clique trees on interval graphs • clique trees are paths, clique trees are path decompositions
• pathwidth = treewidth for interval graphs
• pw(G) = |largest clique| – 1 when G is an interval graph
• For general graph G:
![Page 66: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/66.jpg)
Example
pw(G) = 2 (???)
width(X, P) = 3
![Page 67: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/67.jpg)
Example
pw(G) = 2 (???)
![Page 68: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/68.jpg)
Example
pw(G) = 2 (???)
Finding an interval completion where the size of the largest clique is as small as possible is an NP-hard problem. Even for chordal graphs it is an open question whether or not such an interval completion can be found in polynomial time.
![Page 69: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/69.jpg)
![Page 70: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/70.jpg)
![Page 71: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/71.jpg)
![Page 72: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/72.jpg)
![Page 73: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/73.jpg)
![Page 74: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/74.jpg)
![Page 75: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/75.jpg)
![Page 76: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/76.jpg)
![Page 77: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/77.jpg)
![Page 78: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/78.jpg)
![Page 79: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/79.jpg)
Outline • Tree decomposition - treewidth (tw(G))
• Path decomposition - pathwidth (pw(G))
• partial k-trees
• chordal graphs
• interval graphs
• Connections with tw(G) and pw(G) – chordal graphs and interval graphs
– graph searching
![Page 80: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/80.jpg)
![Page 81: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/81.jpg)
![Page 82: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/82.jpg)
![Page 83: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/83.jpg)
![Page 84: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/84.jpg)
![Page 85: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/85.jpg)
![Page 86: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/86.jpg)
graph searching
![Page 87: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/87.jpg)
![Page 88: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/88.jpg)
![Page 89: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/89.jpg)
![Page 90: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/90.jpg)
![Page 91: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/91.jpg)
![Page 92: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/92.jpg)
![Page 93: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/93.jpg)
![Page 94: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/94.jpg)
![Page 95: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/95.jpg)
![Page 96: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/96.jpg)
![Page 97: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/97.jpg)
![Page 98: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/98.jpg)
![Page 99: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/99.jpg)
![Page 100: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/100.jpg)
![Page 101: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/101.jpg)
![Page 102: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/102.jpg)
![Page 103: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/103.jpg)
![Page 104: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/104.jpg)
![Page 105: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/105.jpg)
![Page 106: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/106.jpg)
![Page 107: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/107.jpg)
![Page 108: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/108.jpg)
![Page 109: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/109.jpg)
![Page 110: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/110.jpg)
![Page 111: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/111.jpg)
![Page 112: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/112.jpg)
![Page 113: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/113.jpg)
![Page 114: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/114.jpg)
![Page 115: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/115.jpg)
![Page 116: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/116.jpg)
![Page 117: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/117.jpg)
![Page 118: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/118.jpg)
![Page 119: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/119.jpg)
![Page 120: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/120.jpg)
![Page 121: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/121.jpg)
![Page 122: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/122.jpg)
![Page 123: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/123.jpg)
![Page 124: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/124.jpg)
![Page 125: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/125.jpg)
![Page 126: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/126.jpg)
![Page 127: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/127.jpg)
![Page 128: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/128.jpg)
![Page 129: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/129.jpg)
![Page 130: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/130.jpg)
![Page 131: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/131.jpg)
![Page 132: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/132.jpg)
![Page 133: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/133.jpg)
![Page 134: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/134.jpg)
![Page 135: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/135.jpg)
![Page 136: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/136.jpg)
![Page 137: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/137.jpg)
![Page 138: Algorithmic Graph Theory Treewidthloukas/courses/grad/Algorithmic_Graph_Theory/Tree… · • Filled graph: the resulting graph • Triangulations can also be computed in other ways:](https://reader034.fdocuments.in/reader034/viewer/2022051915/6006519db728a25077708dbb/html5/thumbnails/138.jpg)