On some interconnections between combinatorial optimization and extremal graph theory
The uniting feature of combinatorial optimization and extremal graph theory is that in both areas one should find extrema of a function defined in most cases on a finite set. While in combinatorial optimization the point is in developing efficient algorithms and heuristics for solving specified type...
| Auteurs principaux: | , , |
|---|---|
| Format: | Article |
| Langue: | English |
| Publié: |
University of Belgrade
2004-01-01
|
| Collection: | Yugoslav Journal of Operations Research |
| Sujets: | |
| Accès en ligne: | http://www.doiserbia.nb.rs/img/doi/0354-0243/2004/0354-02430402147C.pdf |