Using Combinatorics to Prune Search Trees: Independent and Dominating Set

Simple item page
dc.creatorFomin, Fedor V.
dc.creatorGaspers, Serge
dc.creatorSaurabh, Saket
dc.creatorStepanov, Alexey A.
dc.date2006-12-05
dc.date2006-12-14
dc.date.accessioned2026-07-07T09:48:27Z
dc.date.available2026-07-07T09:48:27Z
dc.descriptionThis paper has been withdrawn by the author.
dc.descriptionThis paper has been withdrawn
dc.identifierhttps://arxiv.org/abs/cs/0612028
dc.identifierhttp://arxiv.org/abs/cs/0612028
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/164221
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.titleUsing Combinatorics to Prune Search Trees: Independent and Dominating Set
dc.typetext

Files

Collections

arXiv