Authors
Yasuaki Kobayashi, Yu Nakahata
Publication date
2020/10/5
Journal
arXiv preprint arXiv:2010.02388
Description
In this note, we give an algorithm that computes the linearwidth of input -vertex graphs in time , which improves a trivial -time algorithm, where and the number of vertices and edges, respectively.
Total citations
Scholar articles
Y Kobayashi, Y Nakahata - arXiv preprint arXiv:2010.02388, 2020