Mining for trees in a graph is NP-complete

Simple item page
dc.creatorBussche, Jan Van den
dc.date2007-09-28
dc.date.accessioned2026-07-07T08:32:55Z
dc.date.available2026-07-07T08:32:55Z
dc.descriptionMining for trees in a graph is shown to be NP-complete.
dc.identifierhttps://arxiv.org/abs/0709.4655
dc.identifierhttp://arxiv.org/abs/0709.4655
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/138953
dc.subjectDatabases
dc.subjectArtificial Intelligence
dc.subjectH.2.8
dc.titleMining for trees in a graph is NP-complete
dc.typetext

Files

Collections

arXiv