Matches in SemOpenAlex for { <https://semopenalex.org/work/W2971477758> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W2971477758 endingPage "30" @default.
- W2971477758 startingPage "23" @default.
- W2971477758 abstract "The unsolved problem of isomorphism of graphs is directly related to one of seven so-called millenium problems: with the problem of equality of classes P and NP from the theory of algorithms. The reason of this is a lack of a sertificate algorithm for testing two n-vertex graphs for isomorphism. The quantitative characteristic of the structure of a graph is called a graph invariant. Moreover, an invariant is called complete if the equality of its values for two different graphs means the isomorphism of the graphs under consideration. Currently known complete invariants (for example, the so-called maxi code) are difficult to calculate and do not effectively solve the problem of determining graph isomorphism. In practice, a simpler procedure is applicable, based on the construction of the canonical code of a graph, independent of the order of the numbering of the vertices. The search for partitions when finding a canonical permutation is significantly reduced when using the automorphism group of the graph. Algorithmization of the problem of graph generation on the basis of modifying several types of their adjacency matrix and determining some graph invariants according to the criterion of the greatest informativeness made it possible to carry out computational studies. Analysis of the results of experimental calculations revealed the informativeness of the following graph invariants (informative - for the same differentiation of graphs): the Wiener index, the determinant of the adjacency matrix and with a smaller degree of informativeness of the diameter. Statistically, a low level of informativeness of such invariants of the graph, as a vector of second-order degrees, the number of connected components, radius, Randic index, is revealed. It seems to be a relevant statistical task for the study of pair correlations for these invariants." @default.
- W2971477758 created "2019-09-12" @default.
- W2971477758 creator A5009267621 @default.
- W2971477758 creator A5025751846 @default.
- W2971477758 creator A5074388599 @default.
- W2971477758 date "2019-09-02" @default.
- W2971477758 modified "2023-09-25" @default.
- W2971477758 title "Algorithms for local search in the problem of studying invariants of a graph" @default.
- W2971477758 hasPublicationYear "2019" @default.
- W2971477758 type Work @default.
- W2971477758 sameAs 2971477758 @default.
- W2971477758 citedByCount "0" @default.
- W2971477758 crossrefType "journal-article" @default.
- W2971477758 hasAuthorship W2971477758A5009267621 @default.
- W2971477758 hasAuthorship W2971477758A5025751846 @default.
- W2971477758 hasAuthorship W2971477758A5074388599 @default.
- W2971477758 hasConcept C11413529 @default.
- W2971477758 hasConcept C114614502 @default.
- W2971477758 hasConcept C118615104 @default.
- W2971477758 hasConcept C132525143 @default.
- W2971477758 hasConcept C14201764 @default.
- W2971477758 hasConcept C16640446 @default.
- W2971477758 hasConcept C180356752 @default.
- W2971477758 hasConcept C191916993 @default.
- W2971477758 hasConcept C203776342 @default.
- W2971477758 hasConcept C22149727 @default.
- W2971477758 hasConcept C33923547 @default.
- W2971477758 hasConcept C6049932 @default.
- W2971477758 hasConcept C61665672 @default.
- W2971477758 hasConcept C64339825 @default.
- W2971477758 hasConcept C7036158 @default.
- W2971477758 hasConcept C80899671 @default.
- W2971477758 hasConceptScore W2971477758C11413529 @default.
- W2971477758 hasConceptScore W2971477758C114614502 @default.
- W2971477758 hasConceptScore W2971477758C118615104 @default.
- W2971477758 hasConceptScore W2971477758C132525143 @default.
- W2971477758 hasConceptScore W2971477758C14201764 @default.
- W2971477758 hasConceptScore W2971477758C16640446 @default.
- W2971477758 hasConceptScore W2971477758C180356752 @default.
- W2971477758 hasConceptScore W2971477758C191916993 @default.
- W2971477758 hasConceptScore W2971477758C203776342 @default.
- W2971477758 hasConceptScore W2971477758C22149727 @default.
- W2971477758 hasConceptScore W2971477758C33923547 @default.
- W2971477758 hasConceptScore W2971477758C6049932 @default.
- W2971477758 hasConceptScore W2971477758C61665672 @default.
- W2971477758 hasConceptScore W2971477758C64339825 @default.
- W2971477758 hasConceptScore W2971477758C7036158 @default.
- W2971477758 hasConceptScore W2971477758C80899671 @default.
- W2971477758 hasIssue "9" @default.
- W2971477758 hasLocation W29714777581 @default.
- W2971477758 hasOpenAccess W2971477758 @default.
- W2971477758 hasPrimaryLocation W29714777581 @default.
- W2971477758 hasRelatedWork W1475836543 @default.
- W2971477758 hasRelatedWork W1504159395 @default.
- W2971477758 hasRelatedWork W1591975452 @default.
- W2971477758 hasRelatedWork W1618543895 @default.
- W2971477758 hasRelatedWork W1909289562 @default.
- W2971477758 hasRelatedWork W1947824258 @default.
- W2971477758 hasRelatedWork W1973860121 @default.
- W2971477758 hasRelatedWork W2118091424 @default.
- W2971477758 hasRelatedWork W2393632265 @default.
- W2971477758 hasRelatedWork W2405507785 @default.
- W2971477758 hasRelatedWork W2511773204 @default.
- W2971477758 hasRelatedWork W2574893499 @default.
- W2971477758 hasRelatedWork W2770854599 @default.
- W2971477758 hasRelatedWork W2949149665 @default.
- W2971477758 hasRelatedWork W2962821633 @default.
- W2971477758 hasRelatedWork W2962948643 @default.
- W2971477758 hasRelatedWork W3100180619 @default.
- W2971477758 hasRelatedWork W3200877167 @default.
- W2971477758 hasRelatedWork W3206065045 @default.
- W2971477758 hasRelatedWork W3213765825 @default.
- W2971477758 hasVolume "7" @default.
- W2971477758 isParatext "false" @default.
- W2971477758 isRetracted "false" @default.
- W2971477758 magId "2971477758" @default.
- W2971477758 workType "article" @default.