Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science
Fast and simple approximation of the diameter and radius of a graph
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Hi-index | 0.05 |