Matches in SemOpenAlex for { <https://semopenalex.org/work/W2553501097> ?p ?o ?g. }
Showing items 1 to 84 of
84
with 100 items per page.
- W2553501097 endingPage "72" @default.
- W2553501097 startingPage "56" @default.
- W2553501097 abstract "Graphs have become indispensable in modeling and representing complicated structured data such as proteins, chemical compounds, and XML documents. Development of graph databases for use in research and development is a well-established activity in pharmaceutical and chemical industries. Storing the graphs into large databases is a challenging task as it deals with efficient space and time management. Unlike item sets in huge transactional databases, it becomes essential to ensure the consistency of graph databases since relationships among edges of a graph are predominant. One of the necessary procedures required is a mechanism to check whether two graphs are automorphic. For graphs with more than one vertex with the same label, more than one adjacency matrix representations are possible based on the ordering of vertices with identical labels and there are possibilities that the same graph is stored more than once using different adjacency matrices, leading to adverse results in mining graph databases. Difficulty in identifying and eliminating the automorphic graphs is a challenging problem to the research community. In this paper, a proficient algorithm is devised that efficiently detects and avoids the same graph getting stored into the database. The computational time is also substantially reduced compared to the canonical labeling approach used in Frequent Subgraph Discovery algorithm. The experimental results and comparisons offer a positive response to the newly proposed algorithm." @default.
- W2553501097 created "2016-11-30" @default.
- W2553501097 creator A5024315036 @default.
- W2553501097 creator A5043605292 @default.
- W2553501097 creator A5060622366 @default.
- W2553501097 creator A5070272688 @default.
- W2553501097 date "2010-01-01" @default.
- W2553501097 modified "2023-09-25" @default.
- W2553501097 title "A novel approach for detection and elimination of automorphic graphs in graph databases." @default.
- W2553501097 cites W121339212 @default.
- W2553501097 cites W1484413656 @default.
- W2553501097 cites W1549556210 @default.
- W2553501097 cites W1561092886 @default.
- W2553501097 cites W1592376869 @default.
- W2553501097 cites W2064853889 @default.
- W2553501097 cites W2069578775 @default.
- W2553501097 cites W2101649019 @default.
- W2553501097 cites W2136593687 @default.
- W2553501097 cites W2144587512 @default.
- W2553501097 cites W2158454296 @default.
- W2553501097 cites W22405845 @default.
- W2553501097 cites W2522853541 @default.
- W2553501097 cites W284704 @default.
- W2553501097 cites W4909282 @default.
- W2553501097 cites W1484940001 @default.
- W2553501097 hasPublicationYear "2010" @default.
- W2553501097 type Work @default.
- W2553501097 sameAs 2553501097 @default.
- W2553501097 citedByCount "2" @default.
- W2553501097 countsByYear W25535010972015 @default.
- W2553501097 crossrefType "journal-article" @default.
- W2553501097 hasAuthorship W2553501097A5024315036 @default.
- W2553501097 hasAuthorship W2553501097A5043605292 @default.
- W2553501097 hasAuthorship W2553501097A5060622366 @default.
- W2553501097 hasAuthorship W2553501097A5070272688 @default.
- W2553501097 hasConcept C110484373 @default.
- W2553501097 hasConcept C11413529 @default.
- W2553501097 hasConcept C132525143 @default.
- W2553501097 hasConcept C176225458 @default.
- W2553501097 hasConcept C180356752 @default.
- W2553501097 hasConcept C41008148 @default.
- W2553501097 hasConcept C77088390 @default.
- W2553501097 hasConcept C80444323 @default.
- W2553501097 hasConcept C80899671 @default.
- W2553501097 hasConceptScore W2553501097C110484373 @default.
- W2553501097 hasConceptScore W2553501097C11413529 @default.
- W2553501097 hasConceptScore W2553501097C132525143 @default.
- W2553501097 hasConceptScore W2553501097C176225458 @default.
- W2553501097 hasConceptScore W2553501097C180356752 @default.
- W2553501097 hasConceptScore W2553501097C41008148 @default.
- W2553501097 hasConceptScore W2553501097C77088390 @default.
- W2553501097 hasConceptScore W2553501097C80444323 @default.
- W2553501097 hasConceptScore W2553501097C80899671 @default.
- W2553501097 hasIssue "1" @default.
- W2553501097 hasLocation W25535010971 @default.
- W2553501097 hasOpenAccess W2553501097 @default.
- W2553501097 hasPrimaryLocation W25535010971 @default.
- W2553501097 hasRelatedWork W1874847588 @default.
- W2553501097 hasRelatedWork W1965209002 @default.
- W2553501097 hasRelatedWork W1972243925 @default.
- W2553501097 hasRelatedWork W1990249463 @default.
- W2553501097 hasRelatedWork W2088023238 @default.
- W2553501097 hasRelatedWork W2111036405 @default.
- W2553501097 hasRelatedWork W2166959472 @default.
- W2553501097 hasRelatedWork W2216564370 @default.
- W2553501097 hasRelatedWork W2294667159 @default.
- W2553501097 hasRelatedWork W2390237936 @default.
- W2553501097 hasRelatedWork W2487943872 @default.
- W2553501097 hasRelatedWork W2580647187 @default.
- W2553501097 hasRelatedWork W2611110446 @default.
- W2553501097 hasRelatedWork W2766470123 @default.
- W2553501097 hasRelatedWork W2906856618 @default.
- W2553501097 hasRelatedWork W3021010896 @default.
- W2553501097 hasRelatedWork W3035070303 @default.
- W2553501097 hasRelatedWork W3102705058 @default.
- W2553501097 hasRelatedWork W3123440173 @default.
- W2553501097 hasRelatedWork W842665618 @default.
- W2553501097 hasVolume "3" @default.
- W2553501097 isParatext "false" @default.
- W2553501097 isRetracted "false" @default.
- W2553501097 magId "2553501097" @default.
- W2553501097 workType "article" @default.