( en | de | ru )

 

Disambiguation of "Farley, Arthur M."

Author of the publication

copydeleteadd this publication to your clipboard
Centering a Spanning Tree of a Biconnected Graph.

, , , and . Inf. Process. Lett., 32 (5): 247-250 (1989)

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. You can also use the button next to the name to display some publications already assigned to the person.

Simon M M Laimer

M. Biswas M. Dam

Bernhard M M Lang

Marcel M M Kuypers

Doris M M Eggert

 

Other publications of authors with the same name

Minimal path broadcast networks.. Networks, 43 (2): 61-70 (2004)Optimally Routable Networks.. Parallel Process. Lett., 8 (4): 567-575 (1998)Partitioning trees: Matching, domination, and maximum diameter., , and . Int. J. Parallel Program., 10 (1): 55-61 (1981)The complexity of the defensive domination problem in special graph classes., , and . Discret. Math., 343 (2): 111665 (2020)Extremal graphs having no matching cuts., , and . J. Graph Theory, 69 (2): 206-222 (2012)The Coordination of Multiple Goal Satisfaction.. IJCAI, page 495. William Kaufmann, (1977)Internationalization of computer science education., , , , and . SIGCSE, page 411-415. ACM, (2010)Sparse Hypercube: A Minimal k-Line Broadcast Graph., and . IPPS/SPDP, page 320-324. IEEE Computer Society, (1999)Spanners and message distribution in networks., , , and . Discret. Appl. Math., 137 (2): 159-171 (2004)Sparse Hypercube - Minimal k-line Broadcast Graph., and . Discret. Appl. Math., 127 (3): 431-446 (2003)