Defining families of functions to be used in the search of different structures on graphs

Download: PDF.

“Defining families of functions to be used in the search of different structures on graphs” by R. Santana and E. Ponce de León. In Proceedings of the IX Congreso Iberoamericano de Investigación Operativa, 1998.

Abstract

Search and identification of structures on graphs have been topics extensively considered in the literature. Different approaches are known that face these problems as functions optimization. Most of them emphasize on the search of a particular structure (e.g. cliques, spanning trees, Hamiltonian paths). In the same way, functions are conceived to be optimized using just one method ( e.g. gradient, annealing, genetic algorithms, etc.) Here we introduce families of functions to be used in the search of different structures with several optimization algorithms. Starting from the identification of a dissection on a graph we propose a family of functions that shows good results in the search of a wide set of structures on graphs. We also consider the question of an optimal representation for the solutions space. We have found structures like triangulations, perfect matching and Hamiltonian circuits using different optimization methods. The behavior of the used algorithms is analyzed.

Download: PDF.

BibTeX entry:

@inproceedings{Santana_and_Ponce:1998b,
   author = {R. Santana and E. Ponce de Le{\'o}n},
   title = {Defining families of functions to be used in the search of
	different structures on graphs},
   booktitle = {Proceedings of the IX Congreso Iberoamericano de
	Investigaci{\'o}n Operativa},
   year = {1998}
}

(This webpage was created with bibtex2web.)

Back to Roberto Santana publications.