( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Trade-offs among degree, diameter, and number of paths.

, , , и . Discret. Appl. Math., (2023)

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.

Nobuhisa Ishii

Kei Ishii

Kiyoko Finger-Ishii

 

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

Augmenting a (k-1)-Vertex-Connected Multigraph l-Edge-Connected and k-Vertex-Connected Multigraph., , и . Algorithmica, 44 (3): 257-280 (2006)Posi-modular Systems with Modulotone Requirements under Permutation Constraints., и . ISAAC, том 5878 из Lecture Notes in Computer Science, стр. 473-482. Springer, (2009)A linear time algorithm for L(2,1)-labeling of trees, , , и . CoRR, (2008)An O(n1.75) algorithm for L(2, 1)-labeling of trees., , , и . Theor. Comput. Sci., 410 (38-40): 3702-3710 (2009)A robust algorithm for bisecting a triconnected graph with two resource sets., , и . Theor. Comput. Sci., 341 (1-3): 364-378 (2005)The (2, 1)-Total Labeling Number of Outerplanar Graphs Is at Most Δ + 2., , , и . IWOCA, том 6460 из Lecture Notes in Computer Science, стр. 103-106. Springer, (2010)Algorithmic aspects of distance constrained labeling: a survey., , , и . Int. J. Netw. Comput., 4 (2): 251-259 (2014)Optimal Augmentation of a 2-Vertex-Connected Multigraph to a k-Edge-Connected and 3-Vertex-Connected Multigraph., , и . J. Comb. Optim., 4 (1): 35-77 (2000)Multigraph augmentation under biconnectivity and general edge-connectivity requirements., , и . Networks, 37 (3): 144-155 (2001)Minimum Augmentation of Edge-Connectivity between Vertices and Sets of Vertices in Undirected Graphs., , и . Algorithmica, 56 (4): 413-436 (2010)