Pages that link to "Item:Q709589"
From MaRDI portal
The following pages link to A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes (Q709589):
Displaying 6 items.
- An efficient algorithm for computing permanental polynomials of graphs (Q710005) (← links)
- PentHex puzzles. A reliable and efficient top-down approach to fullerene-structure enumeration (Q1271874) (← links)
- A fast computer algorithm for finding the permanent of adjacency matrices (Q1360652) (← links)
- A mathematical programming model for computing the fries number of a fullerene (Q2282646) (← links)
- A load balancing strategy for parallel computation of sparse permanents. (Q2864488) (← links)
- (Q3643747) (← links)