( en | de | ru )

 

Disambiguation of "Watanabe, Toshimasa"

Author of the publication

copydeleteadd this publication to your clipboard
Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs.

, and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 89-A (11): 3216-3226 (2006)

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.

Wataru Watanabe

Rie Watanabe

Shigeo Watanabe

Norihiro Watanabe

Shigeo Watanabe

 

Other publications of authors with the same name

An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets., , , and . ISCAS, IEEE, (2006)Extracting nonplanar connections in a terminal-vertex graph., and . ISCAS (6), page 121-124. IEEE, (1999)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)Hierarchical extraction of a spanning planar subgraph maintaining clockwise directedness of cycles., and . ISCAS (1), page 172-175. IEEE, (2005)Approximation algorithms for the rectilinear Steiner tree problem with obstacles., , and . ISCAS (2), page 1362-1365. IEEE, (2005)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)Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph., , and . ISCAS, page 2311-2314. IEEE, (1993)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)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)Performance Comparison of Algorithms for the Dynamic Shortest Path Problem., , , and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 90-A (4): 847-856 (2007)