"A Polynomial-Time Algorithm for Reachability Problem of a Subclass of ..."

Le Manh Ha, Van Trung Pham, Thi Ha Duong Phan (2012)

> Home

Details and statistics

DOI: 10.1109/RIVF.2012.6169852

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/rivf/HaPP12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/rivf/HaPP12
Le Manh Ha, Van Trung Pham, Thi Ha Duong Phan:
A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games. RIVF 2012: 1-6

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.