0


为K路径采取的路径

The path taken for k-path
课程网址: http://videolectures.net/algo2012_bjoerklund_k_path/  
主讲教师: Andreas Björklund
开课单位: 隆德大学
开课时间: 信息不详。欢迎您在右侧留言补充。
课程语种: 英语
中文简介:
我们给出了k路径问题的参数化结果的历史描述:给定一个图g和一个正整数k,是否存在一个长度为g的简单路径k。多年来,使用了几种巧妙的方法,稳步减少了运行时间限制。此外,所使用的技术通常也有许多其他的应用。我们将回顾一些旧的结果,并介绍基于代数筛的最新技术。我们还将简单地讨论关于计算k路径的已知信息。
课程简介: We give a historical account of the parametrized results for the k-Path problem: given a graph G and a positive integer k, is there a simple path in G of length k. Throughout the years several ingenious approaches have been used, steadily decreasing the run time bound. Moreover, the techniques used have often found lots of other applications. We will revisit some of the old results, as well as cover the state-of-the-art techniques based on algebraic sieves. We will also briefly talk about what is known about counting k-paths.
关 键 词: 参数化结果; 代数筛; 已知数k
课程来源: 视频讲座网
最后编审: 2019-11-17:cwx
阅读次数: 41