Ordered Tree Compression

Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/20858

Full metadata record

DC Field	Value	Language
dc.contributor.author	Habibeche, Salah Eddine	-
dc.contributor.author	Ben Naoum, Farah	-
dc.date.accessioned	2019-06-19T09:36:22Z	-
dc.date.available	2019-06-19T09:36:22Z	-
dc.date.issued	2019-03-04	-
dc.identifier.citation	2019	en_US
dc.identifier.uri	http://dspace.univ-ouargla.dz/jspui/handle/123456789/20858	-
dc.description	Le 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019	en_US
dc.description.abstract	Ordered trees are trees in which the left to right order among siblings is important. Trees shows repetitions in their intern structure, using this redundancy, this paper seek to reduce the complexity of tree structures by merging its isomorphic subtrees producing a directed acyclic graph without losing data.	en_US
dc.language.iso	en	en_US
dc.publisher	Université Kasdi Merbah Ouargla	en_US
dc.subject	Ordered tree	en_US
dc.subject	Tree reduction	en_US
dc.subject	Tree compression, directed acyclic graph (DAG)	en_US
dc.subject	Tree-isomorphism	en_US
dc.title	Ordered Tree Compression	en_US
dc.type	Article	en_US
Appears in Collections:	2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:

File	Description	Size	Format
Habibeche Salah Eddine.pdf		620,4 kB	Adobe PDF	View/Open

DSpace JSPUI