Results 301 to 310 of about 206,716 (316)

Inexact graph matching by means of estimation of distribution algorithms

Pattern Recognition, 2002
Endika Bengoetxea, Pedro Larranaga, Isabelle Bloch   +2 more
exaly  

Sparsification—a technique for speeding up dynamic graph algorithms

Journal of the ACM, 1997
David Eppstein, Zvi Galil, Giuseppe F Italiano   +2 more
exaly  

Graphs, Algorithms, and Optimization

2016
William L. Kocay, Donald L. Kreher
openaire   +1 more source

An experimental comparison of four graph drawing algorithms

Computational Geometry: Theory and Applications, 1997
Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta   +2 more
exaly  

Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph

International Journal of Computer Mathematics, 1995
Madhumangal Pal, G P Bhattacharjee
exaly  

A Survey of Distributed Graph Algorithms on Massive Graphs

ACM Computing Surveys
Lingkai Meng, Yu Shao, Long Yuan
exaly  

On Algorithms for Enumerating All Circuits of a Graph

SIAM Journal on Computing, 1976
exaly  

Graph partitioning algorithms for optimizing software deployment in mobile cloud computing

Future Generation Computer Systems, 2013
Tim Verbelen, Tim Stevens, Filip De Turck   +2 more
exaly  

Efficient parallel algorithms for some graph problems

Communications of the ACM, 1982
exaly  

Fast and simple algorithms to count the number of vertex covers in an interval graph

Information Processing Letters, 2007
Min-Sheng Lin
exaly