Show simple item record

dc.contributor.authorLipton, Richard
dc.contributor.authorShokrieh, Farbod
dc.date.accessioned2019-07-03T15:15:29Z
dc.date.available2019-07-03T15:15:29Z
dc.date.issued2012-12
dc.identifier.urihttp://hdl.handle.net/1853/61475
dc.descriptionIssued as final reporten_US
dc.description.abstractOur potential theory methods allow us to prove some new results about chip-firing games and to give new proofs and/or generalizations of some known results in the subject. We also show that certain ``ad-hoc'' techniques in the literature are naturally explained or unified by our approach. In particular, we characterize reduced divisors ($G$-parking functions) on graphs as the solution to an energy (or potential) minimization problem and we provide an algorithm to efficiently compute reduced divisors.en_US
dc.description.sponsorshipNational Science Foundation (U.S.)en_US
dc.language.isoen_USen_US
dc.publisherGeorgia Institute of Technologyen_US
dc.relation.ispartofseriesSchool of Computer Science ; Project no. 110069en_US
dc.subjectSpanning tree algorithmen_US
dc.subjectGraph theoryen_US
dc.subjectChip-firingen_US
dc.titleA proposal for research into the Jacobians of graphsen_US
dc.typeTechnical Reporten_US
dc.contributor.corporatenameGeorgia Institute of Technology. Office of Sponsored Programsen_US
dc.contributor.corporatenameGeorgia Institute of Technology. School of Computer Scienceen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record