Finding a Shortest Non-zero Path in Group-Labeled Graphs via Permanent Computation
Crossref DOI link: https://doi.org/10.1007/s00453-016-0142-y
Published Online: 2016-03-10
Published Print: 2017-04
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Kobayashi, Yusuke
Toyooka, Sho
Funding for this research was provided by:
KAKENHI (24106002, 24700004)
Text and Data Mining valid from 2016-03-10