Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/818
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Noble, SD | - |
dc.coverage.spatial | 13 | en |
dc.date.accessioned | 2007-05-26T17:15:44Z | - |
dc.date.available | 2007-05-26T17:15:44Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Combinatorics, Probability and Computing 15: 449-461, May 2006 | en |
dc.identifier.issn | 0963-5483 | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/818 | - |
dc.description.abstract | We consider the complexity of the two-variable rank generating function, $S$, of a graphic 2-polymatroid. For a graph $G$, $S$ is the generating function for the number of subsets of edges of $G$ having a particular size and incident with a particular number of vertices of $G$. We show that for any $x,y \in \mathbb{Q}$ with $xy \not = 1$, it is $\#$P-hard to evaluate $S$ at $(x,y)$. We also consider the $k$-thickening of a graph and computing $S$ for the $k$-thickening of a graph. | en |
dc.format.extent | 131947 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Cambridge University Press | en |
dc.subject | Polymatroid | en |
dc.subject | Rank generating function | en |
dc.subject | Matroid | en |
dc.subject | Computational complexity | en |
dc.subject | #P-hard | en |
dc.subject | Graph | en |
dc.title | Evaluating the rank generating function of a graphic 2-polymatroid | en |
dc.type | Research Paper | en |
dc.identifier.doi | https://doi.org/10.1017/s0963548305007285 | - |
Appears in Collections: | Computer Science Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | 128.85 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.