A Recursive Algorithm for the Maximum Cardinality Independent set
Δελτίο της Ελληνικής Μαθηματικής Εταιρίας (1980)
- Volume: 21, Issue: 21, page 87-110
- ISSN: 0072-7466
Access Full Article
top
How to cite
topE. Loukakis. "A Recursive Algorithm for the Maximum Cardinality Independent set." Δελτίο της Ελληνικής Μαθηματικής Εταιρίας 21.21 (1980): 87-110. <http://eudml.org/doc/236960>.
@article{E1980,
author = {E. Loukakis},
journal = {Δελτίο της Ελληνικής Μαθηματικής Εταιρίας},
keywords = {NP-complete; nondirected graph; recursive algorithm; computational results; vertices; FORTRAN},
language = {eng},
number = {21},
pages = {87-110},
title = {A Recursive Algorithm for the Maximum Cardinality Independent set},
url = {http://eudml.org/doc/236960},
volume = {21},
year = {1980},
}
TY - JOUR
AU - E. Loukakis
TI - A Recursive Algorithm for the Maximum Cardinality Independent set
JO - Δελτίο της Ελληνικής Μαθηματικής Εταιρίας
PY - 1980
VL - 21
IS - 21
SP - 87
EP - 110
LA - eng
KW - NP-complete; nondirected graph; recursive algorithm; computational results; vertices; FORTRAN
UR - http://eudml.org/doc/236960
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.