Maximum Edge Bicliques in Tree Convex Bipartite Graphs.
https://doi.org/10.1007/978-3-319-59605-1_5
@inproceedings{DBLP:conf/faw/ChenL17,
author = {Hao Chen and
Tian Liu},
editor = {Mingyu Xiao and
Frances A. Rosamond},
title = {Maximum Edge Bicliques in Tree Convex Bipartite Graphs},
booktitle = {Frontiers in Algorithmics - 11th International Workshop, {FAW} 2017,
Chengdu, China, June 23-25, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10336},
pages = {47--55},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-59605-1\_5},
doi = {10.1007/978-3-319-59605-1\_5},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/ChenL17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
本页面没有标签