( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Spanning Trees - Short or Small.

, , , , и . SIAM J. Discret. Math., 9 (2): 178-200 (1996)

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.

S Ulrich

S Bachmann

S Hilt

S Hüttelmaier

S Leopold

 

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

Structure-Based Resilience Metrics for Service-Oriented Networks., , , и . EDCC, том 3463 из Lecture Notes in Computer Science, стр. 345-362. Springer, (2005)Upgrading Bottleneck Constrained Forests., , , , и . WG, том 1517 из Lecture Notes in Computer Science, стр. 215-226. Springer, (1998)Modifying Networks to Obtain Low Cost Trees., , , , и . WG, том 1197 из Lecture Notes in Computer Science, стр. 293-307. Springer, (1996)Topology control with a limited number of relays., , , и . GLOBECOM, стр. 645-651. IEEE, (2012)Analysis Problems for Sequential Dynamical Systems and Communicating State Machines., , , , , и . MFCS, том 2136 из Lecture Notes in Computer Science, стр. 159-172. Springer, (2001)Approximate Contagion Model of Common Knowledge on Facebook., , , и . HT, стр. 231-236. ACM, (2016)Intractability and clustering with constraints., и . ICML, том 227 из ACM International Conference Proceeding Series, стр. 201-208. ACM, (2007)A mobility and traffic generation framework for modeling and simulating ad hoc communication networks., , , и . SAC, стр. 122-126. ACM, (2002)Approaches for Assigning Offsets to Signals for Improving Frame Packing in CAN-FD., , , , , , и . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 39 (5): 1109-1122 (2020)Graph Theoretic Analysis of PLA Folding Heuristics., и . J. Comput. Syst. Sci., 46 (3): 326-348 (1993)