( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Enumerating minimum path decompositions to support route choice set generation.

, , и . ANT/SEIT, том 109 из Procedia Computer Science, стр. 196-203. Elsevier, (2017)

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.

Irith Baumann

Irith Wiegand

Irith Bittmann

Irith Bittmann

Irith Reuters

 

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

Using path decomposition enumeration to enhance route choice models., , и . Future Gener. Comput. Syst., (2020)Long Cycles Generate the Cycle Space of a Graph.. Eur. J. Comb., 4 (3): 237-246 (1983)Editorial., , , и . Discret. Appl. Math., 156 (4): 410-411 (2008)The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms., , , и . Discret. Appl. Math., 156 (4): 407-408 (2008)On grid intersection graphs., , и . Discret. Math., 87 (1): 41-52 (1991)On Path Partitions and Colourings in Digraphs.. Graph Theory, Computational Intelligence and Thought, том 5420 из Lecture Notes in Computer Science, стр. 134-143. Springer, (2009)On greene's theorem for digraphs., , и . J. Graph Theory, 18 (2): 169-175 (1994)Contractors' minimum spanning tree., и . Australas. J Comb., (2019)A simulation study of commuting alternatives for day care centres., , , и . Future Gener. Comput. Syst., (2020)Optimal K-Coloring and K-Nesting of Intervals.. ISTCS, том 601 из Lecture Notes in Computer Science, стр. 207-220. Springer, (1992)