Abstract
References
Index Terms
- On the maximum stable set of a permutation graph
Recommendations
Local maximum stable set greedoids stemming from very well-covered graphs
A maximum stable setin a graph G is a stable set of maximum cardinality. The set S is called a local maximum stable set of G, and we write S@?@J(G), if S is a maximum stable set of the subgraph induced by the closed neighborhood of S. A greedoid (V,F) ...
On local maximum stable set greedoids
A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maximum stable set of G, and we write S@?@J(G), if S is a maximum stable set of the subgraph induced by S@?N(S), where N(S) is the neighborhood of S. A greedoid (V,F) ...
The 0-1 inverse maximum stable set problem
In this paper we study the 0-1 inverse maximum stable set problem, denoted by IS"{"0","1"}. Given a graph and a fixed stable set, it is to delete the minimum number of vertices to make this stable set maximum in the new graph. We also consider IS"{"0","...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 24Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in