skip to content
Well-Covered Graphs: A Survey. Preview this item
ClosePreview this item
Checking...

Well-Covered Graphs: A Survey.

Author: Michael D Plummer; VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS.
Publisher: Ft. Belvoir : Defense Technical Information Center, 1991.
Edition/Format:   eBook : English
Database:WorldCat
Summary:
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Material Type: Internet resource
Document Type: Internet Resource
All Authors / Contributors: Michael D Plummer; VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS.
OCLC Number: 227778579
Description: 31 pages ; 23 x 29 cm

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.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/227778579> # Well-Covered Graphs: A Survey.
    a schema:Book, schema:CreativeWork ;
    library:oclcnum "227778579" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/137452306#Place/ft_belvoir> ; # Ft. Belvoir
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/137452306#Topic/paper> ; # Paper
    schema:about <http://experiment.worldcat.org/entity/work/data/137452306#Topic/polynomials> ; # Polynomials
    schema:about <http://experiment.worldcat.org/entity/work/data/137452306#Topic/algorithms> ; # Algorithms
    schema:about <http://experiment.worldcat.org/entity/work/data/137452306#Topic/graphs> ; # Graphs
    schema:about <http://experiment.worldcat.org/entity/work/data/137452306#Topic/surveys> ; # Surveys
    schema:about <http://experiment.worldcat.org/entity/work/data/137452306#Topic/numerical_mathematics> ; # Numerical mathematics
    schema:bookFormat schema:EBook ;
    schema:contributor <http://experiment.worldcat.org/entity/work/data/137452306#Organization/vanderbilt_univ_nashville_tn_dept_of_mathematics> ; # VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS.
    schema:contributor <http://viaf.org/viaf/7451955> ; # Michael D. Plummer
    schema:datePublished "1991" ;
    schema:description "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."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/137452306> ;
    schema:inLanguage "en" ;
    schema:name "Well-Covered Graphs: A Survey."@en ;
    schema:productID "227778579" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/227778579#PublicationEvent/ft_belvoir_defense_technical_information_center_1991> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/137452306#Agent/defense_technical_information_center> ; # Defense Technical Information Center
    schema:url <http://handle.dtic.mil/100.2/ADA247861> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/227778579> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/137452306#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
    schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/137452306#Organization/vanderbilt_univ_nashville_tn_dept_of_mathematics> # VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS.
    a schema:Organization ;
    schema:name "VANDERBILT UNIV NASHVILLE TN Dept. of MATHEMATICS." ;
    .

<http://experiment.worldcat.org/entity/work/data/137452306#Topic/numerical_mathematics> # Numerical mathematics
    a schema:Intangible ;
    schema:name "Numerical mathematics"@en ;
    .

<http://viaf.org/viaf/7451955> # Michael D. Plummer
    a schema:Person ;
    schema:familyName "Plummer" ;
    schema:givenName "Michael D." ;
    schema:name "Michael D. Plummer" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.