( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Capacity Scaling Algorithm for M-convex Submodular Flow.

, , и . IPCO, том 3064 из Lecture Notes in Computer Science, стр. 352-367. Springer, (2004)

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.

Takashi Iwata

Koichiro Iwata

 

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

Horizontal principal structure of layered mixed matrices: decomposition of discrete systems by design-variable selections, и . SIAM J. Discrete Math., 9 (1): 71--86 (1996)A minimax theorem and a Dulmage-Mendelsohn type decomposition for a class of generic partitioned matrices., и . SIAM J. Matrix Anal. Appl., 16 (3): 719-734 (1995)A Faster Algorithm for Minimum Cost Submodular Flows., , и . SODA, стр. 167-174. ACM/SIAM, (1998)A Capacity Scaling Algorithm for Convex Cost Submodular Flows.. SODA, стр. 482-489. ACM/SIAM, (1996)A Strongly Polynomial Cut Canceling Algorithm for Minimum Cost Submodular Flow., , и . SIAM J. Discret. Math., 19 (2): 304-320 (2005)A Blossom Algorithm for Maximum Edge-Disjoint T-Paths., и . SODA, стр. 1933-1944. SIAM, (2020)A Capacity Scaling Algorithm for M-convex Submodular Flow., , и . IPCO, том 3064 из Lecture Notes in Computer Science, стр. 352-367. Springer, (2004)Developing a Management System and Interface for Instant Application Window Sharing., , и . IIAI-AAI, стр. 883-888. IEEE, (2018)Chemical Structure Elucidation from 13C NMR Chemical Shifts: Efficient Data Processing Using Bipartite Matching and Maximal Clique Algorithms., , , , , , и . J. Chem. Inf. Model., 54 (4): 1027-1035 (2014)Any-Application Window Sharing Mechanism Based on WebRTC., , и . IIAI-AAI, стр. 808-813. IEEE Computer Society, (2017)