title: Fast partial-differential synthesis of the matching polynomial of C72-100.
abstract: The Thesis algorithm uses partial-differential edge operators and a grammatical structure to generate and avoid expanding the Matching Polynomial. To run the algorithm efficiently, the vertexes of fullerene graphs C60-100 were sorted into three-dimensional sectors.
authors.affiliation: Department of Chemistry, University of Texas at El Paso 79968, USA.
authors.forename: J M
authors.initials: JM
authors.lastname: Salvador
authors.forename: A
authors.initials: A
authors.lastname: Hernandez
authors.forename: A
authors.initials: A
authors.lastname: Beltran
authors.forename: R
authors.initials: R
authors.lastname: Duran
authors.forename: A
authors.initials: A
authors.lastname: Mactutis
mesh_terms: D000465:Algorithms