An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees

Simple item page
dc.creatorRossello, Francesc
dc.creatorValiente, Gabriel
dc.date2006-04-27
dc.date.accessioned2026-07-07T07:09:26Z
dc.date.available2026-07-07T07:09:26Z
dc.descriptionThe relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common subtree of two trees from a smallest common supertree of them, and vice versa. These constructions are the same for isomorphic, homeomorphic, topological, and minor embeddings, they take only time linear in the size of the trees, and they turn out to have a clear algebraic meaning.
dc.description32 pages
dc.identifierhttps://arxiv.org/abs/cs/0604108
dc.identifierhttp://arxiv.org/abs/cs/0604108
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/111061
dc.subjectData Structures and Algorithms
dc.subjectDiscrete Mathematics
dc.subjectCategory Theory
dc.subjectG.2.3
dc.titleAn Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees
dc.typetext

Files

Collections

arXiv