AAAAAA

   
Results: 1-11 |
Results: 11
PARALLEL ALGORITHMS FOR THE HAMILTONIAN CYCLE AND HAMILTONIAN PATH PROBLEMS IN SEMICOMPLETE BIPARTITE DIGRAPHS
Authors: BANGJENSEN J ELHADDAD M MANOUSSAKIS Y PRZYTYCKA TM
Citation: J. Bangjensen et al., PARALLEL ALGORITHMS FOR THE HAMILTONIAN CYCLE AND HAMILTONIAN PATH PROBLEMS IN SEMICOMPLETE BIPARTITE DIGRAPHS, Algorithmica, 17(1), 1997, pp. 67-87
THE FORWARDING INDEX OF DIRECTED NETWORKS
Authors: MANOUSSAKIS Y TUZA Z
Citation: Y. Manoussakis et Z. Tuza, THE FORWARDING INDEX OF DIRECTED NETWORKS, Discrete applied mathematics, 68(3), 1996, pp. 279-291
HAMILTONIAN PROBLEMS IN EDGE-COLORED COMPLETE GRAPHS AND EULERIAN CYCLES IN EDGE-COLORED GRAPHS - SOME COMPLEXITY RESULTS
Authors: BENKOUAR A MANOUSSAKIS Y PASCHOS VT SAAD R
Citation: A. Benkouar et al., HAMILTONIAN PROBLEMS IN EDGE-COLORED COMPLETE GRAPHS AND EULERIAN CYCLES IN EDGE-COLORED GRAPHS - SOME COMPLEXITY RESULTS, RAIRO. Recherche operationnelle, 30(4), 1996, pp. 417-438
CYCLES OF GIVEN COLOR PATTERNS
Authors: MANOUSSAKIS Y SPYRATOS M TUZA Z
Citation: Y. Manoussakis et al., CYCLES OF GIVEN COLOR PATTERNS, Journal of graph theory, 21(2), 1996, pp. 153-162
OPTIMAL ROUTINGS IN COMMUNICATION-NETWORKS WITH LINEARLY BOUNDED FORWARDING INDEX
Authors: MANOUSSAKIS Y TUZA Z
Citation: Y. Manoussakis et Z. Tuza, OPTIMAL ROUTINGS IN COMMUNICATION-NETWORKS WITH LINEARLY BOUNDED FORWARDING INDEX, Networks, 28(4), 1996, pp. 177-180
ALTERNATING PATHS IN EDGE-COLORED COMPLETE GRAPHS
Authors: MANOUSSAKIS Y
Citation: Y. Manoussakis, ALTERNATING PATHS IN EDGE-COLORED COMPLETE GRAPHS, Discrete applied mathematics, 56(2-3), 1995, pp. 297-309
A PARALLEL REDUCTION OF HAMILTONIAN CYCLE TO HAMILTONIAN PATH IN TOURNAMENTS
Authors: BAMPIS E ELHADDAD M MANOUSSAKIS Y SANTHA M
Citation: E. Bampis et al., A PARALLEL REDUCTION OF HAMILTONIAN CYCLE TO HAMILTONIAN PATH IN TOURNAMENTS, Journal of algorithms, 19(3), 1995, pp. 432-440
WEAKLY HAMILTONIAN-CONNECTED VERTICES IN BIPARTITE TOURNAMENTS
Authors: BANGJENSEN J MANOUSSAKIS Y
Citation: J. Bangjensen et Y. Manoussakis, WEAKLY HAMILTONIAN-CONNECTED VERTICES IN BIPARTITE TOURNAMENTS, J COMB TH B, 63(2), 1995, pp. 261-280
PACKING PROBLEMS IN EDGE-COLORED GRAPHS
Authors: HELL P MANOUSSAKIS Y TUZA Z
Citation: P. Hell et al., PACKING PROBLEMS IN EDGE-COLORED GRAPHS, Discrete applied mathematics, 52(3), 1994, pp. 295-306
GRIDS IN RANDOM GRAPHS
Authors: DELAVEGA WF MANOUSSAKIS Y
Citation: Wf. Delavega et Y. Manoussakis, GRIDS IN RANDOM GRAPHS, Random structures & algorithms, 5(2), 1994, pp. 329-336
COMPUTATION OF THE FORWARDING INDEX VIA FLOWS - A NOTE
Authors: DELEVEGA WF MANOUSSAKIS Y
Citation: Wf. Delevega et Y. Manoussakis, COMPUTATION OF THE FORWARDING INDEX VIA FLOWS - A NOTE, Networks, 24(5), 1994, pp. 273-276
Risultati: 1-11 |