Search
Abstract
We compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
Citations
-
0
CrossRef
-
0
Web of Science
-
1
Scopus
Authors (3)
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Language:
- English
- Publication year:
- 2021
- Bibliographic description:
- Jurkiewicz M., Pastuszak K., Szypulski M.: Graphs hard-to-process for greedy algorithm MIN// / : , 2021,
- DOI:
- Digital Object Identifier (open in new tab) 10.1109/synasc54541.2021.00043
- Verified by:
- Gdańsk University of Technology
seen 137 times