Graph inference from walks 歩行からのグラフ推論

Access this Article

博士論文

1 Introduction 2 Inferring a Graph from a Walk 3 Inferring a Graph from Partial Walks 4 Realizing a Walk on a Graph 5 Conclusions

主1-参1

Abstract / p1 (0003.jp2)
Contents / p7 (0009.jp2)
1 Introduction / p1 (0011.jp2)
1.1 Importance of the graph inference problems / p4 (0014.jp2)
1.2 Contributions / p7 (0017.jp2)
2 Inferring a Graph from a Walk / p17 (0027.jp2)
2.1 Preliminaries / p17 (0027.jp2)
2.2 Degree-bounded graphs / p19 (0029.jp2)
2.3 Trees without any degree-bound constraint / p20 (0030.jp2)
2.4 Trees of bounded degree three / p25 (0035.jp2)
2.5 Approximability / p50 (0060.jp2)
2.6 Concluding remarks / p56 (0066.jp2)
3 Inferring a Graph from Partial Walks / p58 (0068.jp2)
3.1 Tree inference from partial walks / p58 (0068.jp2)
3.2 Linear chain inference from partial walks / p64 (0074.jp2)
3.3 Polynomial-time approximation algorithms / p66 (0076.jp2)
3.4 Concluding remarks / p69 (0079.jp2)
4 Realizing a Walk on a Graph / p72 (0082.jp2)
4.1 Walk realizability problem / p73 (0083.jp2)
4.2 Realizing walks on trees / p76 (0086.jp2)
4.3 Concluding remarks / p85 (0095.jp2)
5 Conclusions / p87 (0097.jp2)
Bibliography / p90 (0100.jp2)

2access