首页--数理科学和化学论文--数学论文--代数、数论、组合理论论文--组合数学(组合学)论文--图论论文

Correctness and Convergence of Belief Propagation for the Chinese Postman Problem

Abstract第3-4页
摘要第5-7页
Chapter 1 Introduction第7-14页
    1.1 The background and related work of belief propagation第7-11页
    1.2 Our results第11-12页
    1.3 Organization第12-14页
Chapter 2 The Chinese postman problem in undirected graph第14-27页
    2.1 Min-Sum BP algorithm第15-16页
    2.2 Main result第16-17页
    2.3 Convergence of BP for UCPP第17-27页
        2.3.1 Computation tree第17-18页
        2.3.2 Main technical lemmas第18-24页
        2.3.3 Extension to arbitrary undirected graph第24-27页
Chapter 3 The Chinese postman problem in directed graph with capacity第27-38页
    3.1 Linear programming relaxation第27-29页
    3.2 Complementary slackness conditions第29-30页
    3.3 The algorithm and result for DCPPC第30-31页
    3.4 Convergence of BP for DCPPC第31-37页
    3.5 The case when εis not well-defined第37-38页
Chapter 4 Asynchronous BP for the Chinese postman problem第38-40页
Chapter 5 Conclusion第40-41页
Bibliography第41-47页
致谢第47页

论文共47页,点击 下载论文
上一篇:Some New Classes of Optimal Variable-Weight Optical Orthogonal Codes
下一篇:多个体系统牵引控制下的能控性