The struction algorithm for the maximum stable set problem revisited (Q1332429): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The basic algorithm for pseudo-Boolean programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4093489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The struction of a graph: Application to CN-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in CAN-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5339894 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(94)90377-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997687746 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:57, 30 July 2024

scientific article
Language Label Description Also known as
English
The struction algorithm for the maximum stable set problem revisited
scientific article

    Statements

    Identifiers