Martin Fürer. Efficient Computation of the Characteristic Polynomial of a Threshold Graph. In Jianxin Wang, Chee-Keng Yap, editors, Frontiers in Algorithmics - 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings. Volume 9130 of Lecture Notes in Computer Science, pages 45-51, Springer, 2015. [doi]
@inproceedings{Furer15,
title = {Efficient Computation of the Characteristic Polynomial of a Threshold Graph},
author = {Martin Fürer},
year = {2015},
doi = {10.1007/978-3-319-19647-3_5},
url = {http://dx.doi.org/10.1007/978-3-319-19647-3_5},
researchr = {https://researchr.org/publication/Furer15},
cites = {0},
citedby = {0},
pages = {45-51},
booktitle = {Frontiers in Algorithmics - 9th International Workshop, FAW 2015, Guilin, China, July 3-5, 2015, Proceedings},
editor = {Jianxin Wang and Chee-Keng Yap},
volume = {9130},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-19646-6},
}