Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
research
oaioai:doaj.org/article:039d86f959dc46e98f20678a30e6a9f2

On some interconnections between combinatorial optimization and extremal graph theory

Authors
Publication date
1 January 2004
Publisher
'National Library of Serbia'
Doi

    Abstract

    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 types of problems, the extremal graph theory deals with finding bounds for various graph invariants under some constraints and with constructing extremal graphs. We analyze by examples some interconnections and interactions of the two theories and propose some conclusions

    Similar works

    Full text

    thumbnail-image

    Directory of Open Access Journals

    redirect
    oaioai:doaj.org/article:039d86f95...
    Last time updated on 18/12/2014

    This paper was published in Directory of Open Access Journals.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.