Computing the number of h-edge spanning forests in complete bipartite graphs
Analysis of Algorithms
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2014-05-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/1248/pdf |
| _version_ | 1827323830842949632 |
|---|---|
| author | Rebecca Stones |
| author_facet | Rebecca Stones |
| author_sort | Rebecca Stones |
| collection | DOAJ |
| description | Analysis of Algorithms |
| first_indexed | 2024-04-25T01:58:50Z |
| format | Article |
| id | doaj.art-b8e2a5c82f144144b9dcf839f78e0829 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:58:50Z |
| publishDate | 2014-05-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-b8e2a5c82f144144b9dcf839f78e08292024-03-07T15:27:46ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502014-05-01Vol. 16 no. 1Analysis of Algorithms10.46298/dmtcs.12481248Computing the number of h-edge spanning forests in complete bipartite graphsRebecca Stones0School of Mathematical Sciences [Clayton]Analysis of Algorithmshttps://dmtcs.episciences.org/1248/pdf[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Rebecca Stones Computing the number of h-edge spanning forests in complete bipartite graphs Discrete Mathematics & Theoretical Computer Science [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | Computing the number of h-edge spanning forests in complete bipartite graphs |
| title_full | Computing the number of h-edge spanning forests in complete bipartite graphs |
| title_fullStr | Computing the number of h-edge spanning forests in complete bipartite graphs |
| title_full_unstemmed | Computing the number of h-edge spanning forests in complete bipartite graphs |
| title_short | Computing the number of h-edge spanning forests in complete bipartite graphs |
| title_sort | computing the number of h edge spanning forests in complete bipartite graphs |
| topic | [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/1248/pdf |
| work_keys_str_mv | AT rebeccastones computingthenumberofhedgespanningforestsincompletebipartitegraphs |