From post

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.

 

Другие публикации лиц с тем же именем

Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph., и . ISAAC, том 834 из Lecture Notes in Computer Science, стр. 217-225. Springer, (1994)Performance Comparison of Algorithms for the Dynamic Shortest Path Problem., , , и . 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., , , и . 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., , , и . ISCAS, IEEE, (2006)An algorithm GMST for extracting minimal siphon-traps and its application to efficient computation of Petri net invariants., , и . ISCAS (3), стр. 172-175. IEEE, (2003)A 2-approximation algorithm FSA+1 to (lambda+1)-edge-connect a specified set of vertices in a lambda-edge-connected graph., , и . ISCAS (3), стр. 236-239. IEEE, (2003)Minimum-cost augmentation to 3-edge-connect all specified vertices in a graph., , и . ISCAS, стр. 2311-2314. IEEE, (1993)Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets., , , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 96-A (2): 540-553 (2013)Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs., и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 89-A (11): 3216-3226 (2006)Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem., , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 91-A (4): 1140-1149 (2008)