( en | de | ru )

 

Disambiguation of "Taoka, Satoshi"

Author of the publication

copydeleteadd this publication to your clipboard
Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets.

, and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 92-A (11): 2707-2716 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Satoshi Ejima

Satoshi Okawa

Satoshi Otomo

Satoshi Murayama

Satoshi Nishida

 

Other publications of authors with the same name

Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph., and . ISAAC, volume 834 of Lecture Notes in Computer Science, page 217-225. Springer, (1994)Performance Comparison of Algorithms for the Dynamic Shortest Path Problem., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 90-A (4): 847-856 (2007)Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 101-A (2): 357-366 (2018)An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets., , , and . ISCAS, IEEE, (2006)Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph., , and . ISCAS, page 2311-2314. IEEE, (1993)A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph., , and . ISCAS (3), page 236-239. IEEE, (2003)An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants., , and . ISCAS (3), page 172-175. IEEE, (2003)Approximation algorithms for minimum-cost augmentation to k-edge-connect a multigraph., , and . ISCAS, page 2556-2559. IEEE, (1993)Two efficient methods for computing Petri net invariants., , , and . SMC, page 2717-2722. IEEE, (2001)A new heuristic method for solving the minimum initial marking problem of Petri nets., , and . SMC, page 3218-3223. IEEE, (2000)