Restricted Bipartite Graphs: Comparison and Hardness Results.


https://doi.org/10.1007/978-3-319-07956-1_22
@inproceedings{DBLP:conf/aaim/Liu14, author = {Tian Liu}, editor = {Qianping Gu and Pavol Hell and Boting Yang}, title = {Restricted Bipartite Graphs: Comparison and Hardness Results}, booktitle = {Algorithmic Aspects in Information and Management - 10th International Conference, {AAIM} 2014, Vancouver, BC, Canada, July 8-11, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8546}, pages = {241--252}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-07956-1\_22}, doi = {10.1007/978-3-319-07956-1\_22}, timestamp = {Tue, 14 May 2019 10:00:41 +0200}, biburl = {https://dblp.org/rec/conf/aaim/Liu14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21