DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
ADA247861
Title:
Well-Covered Graphs: A Survey
Descriptive Note:
Corporate Author:
VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS
Report Date:
1991-01-01
Pagination or Media Count:
31.0
Abstract:
A graph G is well-covered or w-c if every maximal independent set of points in G is also maximum. Clearly, this is equivalent to the property that the greedy algorithm for constructing a maximal independent set always results in a maximum independent set. Although the problem of independence number is well-known to be NP-complete, it is trivially polynomial for well covered graphs. The concept of well-coveredness was introduced by the author in PI and was first discussed therein with respect to its relationship to a number of other properties involving the independence number. Since then, a number of results about well-covered graphs have been obtained. It is our purpose in this paper to survey these results for the first time. As the reader will see, many of the results we will discuss are quite recent and have not as yet appeared in print.
Distribution Statement:
APPROVED FOR PUBLIC RELEASE
