Results 1 -
1 of
1
A linear-time algorithm to nd independent spanning trees in maximal planar graphs, sf (1928)
by S Nagai, S Nakano
| Venue: | Proc. Graph-Theoretic Concepts in Computer Science,(WG'00), LNCS |
