( en | de | ru )

 

Disambiguation of "Haddad, Mohamed El"

Author of the publication

copydeleteadd this publication to your clipboard
A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments.

, , , and . PARLE, volume 694 of Lecture Notes in Computer Science, page 553-560. Springer, (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. You can also use the button next to the name to display some publications already assigned to the person.

Houda El-Haddad

Mohamed Ahmed Haddad

Mohamed El-Kahlout

Mohamed El-Menuawy

Mohamed El-Shazly

 

Other publications of authors with the same name

A new scalable leader-community detection approach for community detection in social networks., , and . Soc. Networks, (2018)Communities Identification Using Nodes Features., , , and . ISMIS, volume 9384 of Lecture Notes in Computer Science, page 303-312. Springer, (2015)Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs., , , and . Algorithmica, 17 (1): 67-87 (1997)Upper bounds for the forwarding indices of communication networks., , and . Discret. Math., 286 (3): 233-240 (2004)LeadersRank: Towards a new approach for community detection in social networks., , and . AICCSA, page 1-8. IEEE Computer Society, (2015)Towards a New Approach for Community Detection Algorithm in Social Networks., , and . BDCA, volume 1580 of CEUR Workshop Proceedings, page 23-28. CEUR-WS.org, (2015)Influentials identification for community detection in complex networks., , and . CIST, page 111-115. IEEE, (2016)A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments., , , and . PARLE, volume 694 of Lecture Notes in Computer Science, page 553-560. Springer, (1993)The Forwarding Diameter of Graphs., , , and . Discret. Appl. Math., 86 (2-3): 201-211 (1998)A Parallel Reduction of Hamiltonian Cycle to Hamiltonian Path in Tournaments., , , and . J. Algorithms, 19 (3): 432-440 (1995)