( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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)

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.

Satoshi Ejima

Satoshi Okawa

Satoshi Otomo

Satoshi Murayama

Satoshi Nishida

 

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

Efficient approximation algorithms for the maximum weight matching problem., , и . ISCAS (4), стр. 457-460. IEEE, (2002)Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree., , и . ISCAS, стр. 2934-2937. IEEE, (2009)Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets., и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 92-A (11): 2707-2716 (2009)Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants., , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 85-A (11): 2436-2446 (2002)k-edge-connectivity augmentation problem with upper bounds on edge multiplicity., , и . ISCAS, стр. 601-604. IEEE, (2000)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)Minimum Augmentation to k-Edge-Connect Specified Vertices of a Graph., и . ISAAC, том 834 из Lecture Notes in Computer Science, стр. 217-225. Springer, (1994)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)