1999
DOI: 10.1002/(sici)1097-0118(199902)30:2<113::aid-jgt5>3.0.co;2-#
|View full text |Cite
|
Sign up to set email alerts
|

A note on vertex orders for stability number

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2003
2003
2020
2020

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…The heuristic methods are more efficient than the exact methods. Among them, the popular algorithms include the vertex order method [29], the MIN method [30], the MAX method [31] and the vertex support (VS) algorithm [24]. Both the VO and MIN methods iteratively select the minimum degree vertices and add them into the independent set that is built in the case of no conflict.…”
Section: ) Maximum Independent Set Problemmentioning
confidence: 99%
“…The heuristic methods are more efficient than the exact methods. Among them, the popular algorithms include the vertex order method [29], the MIN method [30], the MAX method [31] and the vertex support (VS) algorithm [24]. Both the VO and MIN methods iteratively select the minimum degree vertices and add them into the independent set that is built in the case of no conflict.…”
Section: ) Maximum Independent Set Problemmentioning
confidence: 99%