arXiv Open Access 2016

Counting Spanning trees in double nested graphs

Fernando Tura

Lihat Sumber

Abstrak

In this paper we give a linear time algorithm for computing the number of spanninig trees in double nested graphs.

math.CO

Fernando Tura

APA MLA BibTeX

Tura, F. (2016). Counting Spanning trees in double nested graphs. https://arxiv.org/abs/1605.04760

Lihat di Sumber

Informasi Jurnal