首页
学术期刊
论文检测
AIGC检测
热点
更多
数据
Listing Maximal k-Plexes in Large Real-World Graphs
被引:0
作者
:
Wang, Zhengren
论文数:
0
引用数:
0
h-index:
0
机构:
University of Electronic Science and Technology of China, Chengdu, China
University of Electronic Science and Technology of China, Chengdu, China
Wang, Zhengren
[
1
]
Zhou, Yi
论文数:
0
引用数:
0
h-index:
0
机构:
University of Electronic Science and Technology of China, Chengdu, China
University of Electronic Science and Technology of China, Chengdu, China
Zhou, Yi
[
1
]
Xiao, Mingyu
论文数:
0
引用数:
0
h-index:
0
机构:
University of Electronic Science and Technology of China, Chengdu, China
University of Electronic Science and Technology of China, Chengdu, China
Xiao, Mingyu
[
1
]
论文数:
引用数:
h-index:
机构:
Khoussainov, Bakhadyr
[
1
]
机构
:
[1]
University of Electronic Science and Technology of China, Chengdu, China
来源
:
WWW 2022 - Proceedings of the ACM Web Conference 2022
|
2022年
关键词
:
Compendex;
D O I
:
暂无
中图分类号
:
学科分类号
:
摘要
:
Graph algorithms
引用
收藏
页码:1517 / 1527
相关论文
共 1 条
[1]
Listing all maximal cliques in large sparse real-world graphs
Department of Computer Science, University of California, Irvine, United States
论文数:
0
引用数:
0
h-index:
0
Department of Computer Science, University of California, Irvine, United States
Lect. Notes Comput. Sci.,
(364-375):
←
1
→