Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/16255
Full metadata record
DC FieldValueLanguage
dc.contributor.authorIVANOVA, Krassimira-
dc.contributor.authorVANHOOF, Koen-
dc.contributor.authorMARKOV, Krassimir-
dc.contributor.authorVelychko, Vitalii-
dc.date.accessioned2014-01-31T08:50:36Z-
dc.date.available2014-01-31T08:50:36Z-
dc.date.issued2013-
dc.identifier.citationInformation Theories and Applications, 20 (3), p. 263-284-
dc.identifier.issn1310-0513-
dc.identifier.urihttp://hdl.handle.net/1942/16255-
dc.description.abstractThis paper introduces an approach to storing graphs based on the Natural Language Addressing in multidimensional numbered information spaces. A sample graph is analyzed to find its proper NL-representation. Taking in account the interrelations between nodes and edges, a “multi-layer” representation is possible and identifiers of nodes and edges can be avoided. The advantages and disadvantages of NL-addressing for the multi-layer representation of graphs are discussed.-
dc.language.isoen-
dc.subject.othergraphs; addressing; natural language addressing-
dc.titleIntroduction to Storing Graphs by NL-Addressing-
dc.typeJournal Contribution-
dc.identifier.epage284-
dc.identifier.issue3-
dc.identifier.spage263-
dc.identifier.volume20-
local.bibliographicCitation.jcatA1-
local.type.refereedNon-Refereed-
local.type.specifiedArticle-
local.identifier.vabbc:vabb:344224-
item.contributorIVANOVA, Krassimira-
item.contributorVANHOOF, Koen-
item.contributorMARKOV, Krassimir-
item.contributorVelychko, Vitalii-
item.fulltextWith Fulltext-
item.validationvabb 2015-
item.fullcitationIVANOVA, Krassimira; VANHOOF, Koen; MARKOV, Krassimir & Velychko, Vitalii (2013) Introduction to Storing Graphs by NL-Addressing. In: Information Theories and Applications, 20 (3), p. 263-284.-
item.accessRightsOpen Access-
crisitem.journal.issn1310-0513-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
introduction 1.pdf2.14 MBAdobe PDFView/Open
Show simple item record

Page view(s)

36
checked on Aug 25, 2023

Download(s)

64
checked on Aug 25, 2023

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.