( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Cycle prefix digraphs for symmetric interconnection networks.

, , и . Networks, 23 (7): 641-649 (1993)

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.

Colin Vance

Johann Vancea

Eligius Vancek

Kathleen A Vance

Georgeta Vancea

 

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

Edge-coloring linear hypergraphs with medium-sized edges., и . Random Struct. Algorithms, 55 (1): 153-159 (2019)Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry., , , , , , , , и . WAE, том 2141 из Lecture Notes in Computer Science, стр. 172-184. Springer, (2001)Review of chromatic graph theory by Gary Chartrand and Ping Zhang.. SIGACT News, 42 (3): 23-28 (2011)Low-Bandwidth Routing and Electrical Power Networks., , , , и . ICALP, том 1443 из Lecture Notes in Computer Science, стр. 604-615. Springer, (1998)Centroidal Voronoi Tessellations: Applications and Algorithms., , и . SIAM Rev., 41 (4): 637-676 (1999)A computational attack on the conjectures of Graffiti: New counterexamples and proofs., , и . Discret. Math., 147 (1-3): 35-55 (1995)Algebraic Constructions of Efficient Broadcast Networks., , и . AAECC, том 539 из Lecture Notes in Computer Science, стр. 152-158. Springer, (1991)Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk.. PPSC, стр. 412. SIAM, (1987)Global communication algorithms for Cayley graphs. CoRR, (2013)Cycle prefix digraphs for symmetric interconnection networks., , и . Networks, 23 (7): 641-649 (1993)