• Publications
  • Influence
Algorithms for computing parsimonious evolutionary scenarios for genome evolution, the last universal common ancestor and dominance of horizontal gene transfer in the evolution of prokaryotes
BackgroundComparative analysis of sequenced genomes reveals numerous instances of apparent horizontal gene transfer (HGT), at least in prokaryotes, and indicates that lineage-specific gene loss mightExpand
  • 369
  • 22
  • PDF
An algorithm for finding hamilton paths and cycles in random graphs
This paper describes a polynomial time algorithm HAM that searches for Hamilton cycles in undirected graphs. On a random graph its asymptotic probability of success is that of the existence of such aExpand
  • 119
  • 12
On the existence of Hamiltonian cycles in a class of random graphs
A digraph with n vertices and fixed outdegree m is generated randomly so that each such digraph is equally likely to be chosen. Expand
  • 54
  • 8
On key storage in secure networks
We consider systems where the keys for encrypting messages are derived from the pairwise intersections of sets of private keys issued to the users. Expand
  • 103
  • 7
On the connectivity of randomm-orientable graphs and digraphs
We consider graphs and digraphs obtained by randomly generating a prescribed number of arcs incident at each vertex.We analyse their almost certain connectivity and apply these results to theExpand
  • 65
  • 6
A novel bibliometric index with a simple geometric interpretation
We propose the χ-index as a bibliometric indicator that generalises the h-index. While the h-index is determined by the maximum square that fits under the citation curve of an author when plottingExpand
  • 32
  • 6
  • PDF
Hamiltonian cycles in random regular graphs
We prove that for r≥r0 almost all vertex-labelled r-regular graphs have Hamiltonian cycles. Expand
  • 42
  • 4
Modelling the navigation potential of a web page
We show that the distribution of the effective number of links that the user can follow at each navigation step after pruning, i.e. the number of nodes added to the potential gain at that step, is given by the erf function. Expand
  • 3
  • 2
  • PDF