Tree Convex Bipartite Graphs: NP -Complete Domination, Hamiltonicity and Treewidth.
https://doi.org/10.1007/978-3-319-08016-1_23
@inproceedings{DBLP:conf/faw/WangCLTLX14,
author = {Chaoyi Wang and
Hao Chen and
Zihan Lei and
Ziyang Tang and
Tian Liu and
Ke Xu},
editor = {Jianer Chen and
John E. Hopcroft and
Jianxin Wang},
title = {Tree Convex Bipartite Graphs: \emph{NP} -Complete Domination, Hamiltonicity
and Treewidth},
booktitle = {Frontiers in Algorithmics - 8th International Workshop, {FAW} 2014,
Zhangjiajie, China, June 28-30, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8497},
pages = {252--263},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08016-1\_23},
doi = {10.1007/978-3-319-08016-1\_23},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/WangCLTLX14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签