tree decomposition benoit vanalderweireldt phan quoc trung tram minh tri vu thi phuong 1
TRANSCRIPT
![Page 1: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/1.jpg)
Tree Decompositio
nBenoit Vanalderweireldt
Phan Quoc TrungTram Minh TriVu Thi Phuong
1
![Page 2: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/2.jpg)
Summary
2
• Introduction• Definition• Requirement• Data structure • Graph generators• Algorithm• Example• Benchmark and tests• Interpretation• Conclusion
![Page 3: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/3.jpg)
Definition
3
Tree decomposition
![Page 4: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/4.jpg)
Definition
4
Tree width
1.The width of a bag is the cardinality of the bag.
2.The width of a tree decomposition is the size of the
largest bag minus one
3.The treewidth of a graph G is the minimum width
among all possible tree decompositions of G minus 1,
denoted as tw(G).
Note that trees and forests are precisely the structures
with treewidth of 1.
![Page 5: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/5.jpg)
Introduction
5
Graph reachability answering using tree decomposition ?
Is it profitable to decompose a graphIn order to test reachability ?
![Page 6: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/6.jpg)
Requirement
6
1. Understand notion of tree decomposition2. Develop a data structure for graphs3. Develop different graph generators4. Implement the 4 parts of the algorithms5. Make benchmark6. Analyze result7. Make conclusion8. Write report9. Present our work
![Page 7: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/7.jpg)
Data structure
7
• Vertex• Tree • Node
![Page 8: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/8.jpg)
Graph generators
8
In order to test the algorithm, we generated various kind of graphs :1. Inclusive square graph2. Friendship graph3. Random graph
Friendship graph
![Page 9: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/9.jpg)
Algorithm
9
Algorithm 1 start with reduction of an undirected graph before construction the tree
![Page 10: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/10.jpg)
Algorithm
10
Explanation in following examples
![Page 11: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/11.jpg)
Algorithm
11
![Page 12: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/12.jpg)
Example
12
Random graph
![Page 13: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/13.jpg)
Example
13
Random graph
6
7
![Page 14: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/14.jpg)
Example
14
1
2
34
5
2
34
5
34
5
Complete graph
1
2
3
![Page 15: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/15.jpg)
Example
15
5
6 7
4
3
21
5
6 7
4
3
2
5
6 7
4
3
5
6 7
4
Wheel Graph
5
6 7
1 2
3 45
![Page 16: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/16.jpg)
Example
16
31 2
46 5
32
46 5
3
46 5
Bipartite Graph
46 5
1 2 3
4
![Page 17: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/17.jpg)
Example
17
Cycle graph
![Page 18: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/18.jpg)
Benchmark
18
The main goal of benchmark is to reveal in what condition it is gainful to reduced graph in order to check reachability.We run multiple series of benchmark :• Various number of vertices and neighbors• …..
Every test series have been past at least 2 times (to operating system accident)We compare effective results with expected resultsOur series (around 20 measures) vary (increase or decrease) numbers of edges or vertices
What else ?
![Page 19: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/19.jpg)
Benchmark
19
In order to have workable measure, we have to establish a protocol to collect data. We quickly realize that to have meaningful results, we need to apply the algorithm of really large graph (over hundred of vertices).
Put some capture of result like in report
![Page 20: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/20.jpg)
Interpretation
20
From these tests we found that the execution time of this algorithm is influenced by number of edges not really by number of vertices. If the density of edges increases then the computing time for the graph reduction increase. In order to use this algorithm in a goodresponding time, the density of edges must be well know.
![Page 21: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/21.jpg)
Advantage & Disadvantage
21
Advantage of Tree Decomposition:
Solving shortest path query answering over undirected large
graphs.
Many intractable problems (Independent Set, the Hamiltonian
Circuits) can be solved in polynomial time or even in linear timeDisadvantage of Tree Decomposition:
Calculating the tree width of a graph is hard. (NP-complete)It’s impossible to guarantee that good performance will be
obtained even though the tree width can be determined.
To solve really hard problems efficiently by using the tree decomposition based approaches, we have to require that the underlying graphs have bounded tree width (less than 10)
![Page 22: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/22.jpg)
Conclusion
22
1. In this project, we implemented the algorithm of tree decomposition as the index structure for a large graphs to answer reachability queries efficiently.
2. This approach used to solve intractable problems (NP-complete)3. One of the limitation of tree decomposition based approach is the
underlying graphs have bounded treewidth, but in this algorithm the treewidth is adapted to be related to degree-l reduction, instead of the treewidth.
![Page 23: Tree Decomposition Benoit Vanalderweireldt Phan Quoc Trung Tram Minh Tri Vu Thi Phuong 1](https://reader038.vdocuments.net/reader038/viewer/2022110404/56649eab5503460f94bb0347/html5/thumbnails/23.jpg)
Acknowledgements
23
This project was supported by a grant from the professor Bruno Courcelle and Anne Dicky
Reference1.Efficient Graph Reachability Query Answering using Tree Decomposition, by
Fang Wei (Computer Science Department, University of Freiburg, Germany).2.Discrete Math for Bioinformatics, by A. Bockmayr/K3. A partial k-arboretum of graph with bounded treewidth, by Hans Bodlaender