Large Hypertree Width for Sparse Random Hypergraphs.
https://doi.org/10.1007/978-3-642-38756-2_30
@inproceedings{DBLP:conf/aaim/WangLX13,
author = {Chaoyi Wang and
Tian Liu and
Ke Xu},
editor = {Michael R. Fellows and
Xuehou Tan and
Binhai Zhu},
title = {Large Hypertree Width for Sparse Random Hypergraphs},
booktitle = {Frontiers in Algorithmics \emph{and} Algorithmic Aspects in Information
and Management, Third Joint International Conference, {FAW-AAIM} 2013,
Dalian, China, June 26-28, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7924},
pages = {294--302},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38756-2\_30},
doi = {10.1007/978-3-642-38756-2\_30},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/aaim/WangLX13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签