Parameterized Aspects of Triangle Enumeration
Parameterized Aspects of Triangle Enumeration
复制标题
三角形枚举的参数化方面
DOI:
10.1007/978-3-662-55751-8_9
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
R. Niedermeier
中科院分区:
文献类型:
--
作者:
M. Bentert;T. Fluschnik;A. Nichterlein;R. Niedermeier
The task of listing all triangles in an undirected graph is a fundamental graph primitive with numerous applications. It is trivially solvable in time cubic in the number of vertices. It has seen a significant body of work contributing to both theoretical aspects (e.g., lower and upper bounds on running time, adaption to new computational models) as well as practical aspects (e.g. algorithms tuned for large graphs). Motivated by the fact that the worst-case running time is cubic, we perform a systematic parameterized complexity study of triangle enumeration. We provide both positive results (new enumerative kernelizations, “subcubic” parameterized solving algorithms) as well as negative results (presumable uselessness in terms of “faster” parameterized algorithms of certain parameters such as graph diameter). To this end, we introduce new and extend previous concepts.
登录
查看更多内容
DOI:
--
发表时间:
2014
期刊:
Encyclopedia of Social Network Analysis and Mining
影响因子:
--
作者:
Emilio Ferrara
通讯作者:
Emilio Ferrara
DOI:
10.1137/1.9781611974331.ch28
发表时间:
2016
期刊:
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
影响因子:
--
作者:
Amir Abboud;Virginia Vassilevska Williams;Joshua R. Wang
通讯作者:
Joshua R. Wang
DOI:
10.1007/10692760_1
发表时间:
1998-06
期刊:
--
影响因子:
--
作者:
B. Courcelle;J. Makowsky;Udi Rotics
通讯作者:
B. Courcelle;J. Makowsky;Udi Rotics
DOI:
10.1007/978-3-319-94418-0_19
发表时间:
2017-10
期刊:
--
影响因子:
--
作者:
T. Fluschnik;G. B. Mertzios;A. Nichterlein
通讯作者:
T. Fluschnik;G. B. Mertzios;A. Nichterlein
DOI:
--
发表时间:
2016
期刊:
arXiv.org
影响因子:
--
作者:
G. B. Mertzios;A. Nichterlein;R. Niedermeier
通讯作者:
R. Niedermeier