Please use this identifier to cite or link to this item:
https://dspace.iiti.ac.in/handle/123456789/19099
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Singh, Ranveer | en_US |
| dc.date.accessioned | 2026-09-11T12:21:13Z | - |
| dc.date.available | 2026-09-11T12:21:13Z | - |
| dc.date.issued | 2025 | - |
| dc.identifier.citation | Chakrabartty, S., & Singh, R. (2025). Computing the Permanental Polynomial of Bipartite Graphs. ACM Communications in Computer Algebra, 59(4), 116–120. https://doi.org/10.1145/3832046.3832058 | en_US |
| dc.identifier.issn | 1932-2232 | - |
| dc.identifier.other | EID(2-s2.0-105047845061) | - |
| dc.identifier.uri | https://dx.doi.org/10.1145/3832046.3832058 | - |
| dc.identifier.uri | https://dspace.iiti.ac.in/handle/123456789/19099 | - |
| dc.description.abstract | The computation of the permanental polynomial of a matrix is a well-known computationally hard problem, even for (0, 1)-matrices. We define a modified characteristic polynomial by altering the signs of certain coefficients in the characteristic polynomial, and show that the permanental polynomial can be expressed as a linear combination of modified characteristic polynomials of subgraphs obtained by successively removing vertex-disjoint 4k-cycles. © 2025 Copyright is held by the owner/author(s) | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Association for Computing Machinery | en_US |
| dc.source | ACM Communications in Computer Algebra | en_US |
| dc.title | Computing the Permanental Polynomial of Bipartite Graphs | en_US |
| dc.type | Journal Article | en_US |
| Appears in Collections: | Department of Computer Science and Engineering | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
Altmetric Badge: