On Subgraph Isomorphism

Simple item page
dc.creatorGubin, Sergey
dc.date2008-02-19
dc.date2008-08-14
dc.date.accessioned2026-07-07T10:16:43Z
dc.date.available2026-07-07T10:16:43Z
dc.descriptionArticle explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
dc.descriptionSimplified, 6 pages
dc.identifierhttps://arxiv.org/abs/0802.2612
dc.identifierhttp://arxiv.org/abs/0802.2612
dc.identifierPolynomial size asymmetric linear model for Subgraph Isomorphism, Proceedings WCECS 2008, ISBN: 978-988-98671-0-2, pp.241-246
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173604
dc.subjectDiscrete Mathematics
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.subjectCombinatorics
dc.subjectF.2.0; G.2.1; G.2.2
dc.titleOn Subgraph Isomorphism
dc.typetext

Files

Collections

arXiv