Results 31 to 40 of about 81,779 (307)
The graph isomorphism problem on geometric graphs [PDF]
, 2013 The graph isomorphism (GI) problem asks whether two given graphs are isomorphic or not. The GI problem is quite basic and simple, however, it's time complexity is a long standing open problem. The GI problem is clearly in NP, no polynomial time algorithm
Ryuhei Uehara, Uehara, Ryuhei
core +1 more source
Graph Isomorphism Completeness for Chordal Bipartite Graphs and Strongly Chordal Graphs [PDF]
, 2005 This paper deal with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chrdal graphs. It is known that GI problem is GI complete for some special graph classes including regular graphs, bipartite graphs ...
Nagoya, Takayuki +2 more
core +1 more source
Occurrence of Associated Elements in a Copper Mine by EDX-SEM
Yankuang ceshi, 2021 BACKGROUND Associated elements in copper deposits are of high economic value. However, they are difficult to locate and utilize because of their fine (micrometer to nanometer) size.
WANG Guan +4 more
doaj +1 more source
Science Advances, 2019 The effect of isovalent isomorphism to minimize lithium trapping enables a high initial Coulombic efficiency of Si anode. Silicon demonstrates great potential as a next-generation lithium ion battery anode because of high capacity and elemental abundance.
Bin Zhu +10 more
semanticscholar +1 more source
Jordan Isomorphisms on Nest Subalgebras
Advances in Mathematical Physics, 2015 This paper is devoted to the study of Jordan isomorphisms on nest subalgebras of factor von Neumann algebras. It is shown that every Jordan isomorphism ϕ between the two nest subalgebras algMβ and algMγ is either an isomorphism or an anti-isomorphism.
Aili Yang
doaj +1 more source
Recursive-Parallel Algorithm for Solving the Maximum Common Subgraph Problem
Моделирование и анализ информационных систем, 2023 The paper proposes an algorithm for solving the problem of finding the maximum common subgraph. Both the sequential and the parallel version of the algorithm, their software implementation are described, and an experimental study of their effectiveness ...
Vladimir V. Vasilchikov
doaj +1 more source
Equivalences between isomorphism classes on infinite graphs [PDF]
, 1992 summary:The paper studies some equivalence relations between isomorphism classes of countable graphs which correspond in a certain sense to various distances between isomorphism classes of finite ...
Zelinka, Bohdan
core +1 more source
, 2017 Isomorphism: Initially referring to the structuralist, in particular glossematic, hypothesis that the expression and meaning of linguistic signs show structural parallelisms, the term isomorphism is used in current linguistic theory to designate the one ...
Willems, Klaas
core +1 more source
An Optimization of Closed Frequent Subgraph Mining Algorithm
Cybernetics and Information Technologies, 2017 Graph mining isamajor area of interest within the field of data mining in recent years. Akey aspect of graph mining is frequent subgraph mining. Central to the entire discipline of frequent subgraph mining is the concept of subgraph isomorphism.
Demetrovics J. +3 more
doaj +1 more source
Axioms, 2023 In this article, we apply a new class of fuzzy control functions to approximate a Cauchy additive mapping in fuzzy Banach space (FBS). Further, considering the unital FBS (UFBS), we will investigate the isomorphisms defined in this space.
Zahra Eidinejad +2 more
doaj +1 more source