Results 21 to 30 of about 274,718 (261)
Towards an Isomorphism Dichotomy for Hereditary Graph Classes [PDF]
, 2014 In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs.
Schweitzer, Pascal
core +3 more sources
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
Journal of Symbolic Logic, 1996 AbstractIf T has only countably many complete types, yet has a type of infinite multiplicity then there is a c.c.c. forcing notion such that, in any -generic extension of the universe, there are non-isomorphic models M1 and M2 of T that can be forced isomorphic by a c.c.c. forcing. We give examples showing that the hypothesis on the number of complete
Laskowski, M. C., Shelah, Saharon
openaire +3 more sources
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
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs [PDF]
, 2010 The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99].
Das, Bireswar +2 more
core +5 more sources
Isomorphic cohomology yields isomorphic homology
Manuscripta Mathematica, 1997 Given a map \(f:X\rightarrow Y\) of locally compact Hausdorff spaces, \textit{W. S. Massey} [Algebraic topology: an introduction (1967; Zbl 0153.24901)] has shown that if \(f\) induces an isomorphism \(H^n(X;{\mathbb{Z}})\cong H^n(Y;{\mathbb{Z}})\) for all \(n\geq 0\), then \(f\) induces an isomorphism in homology with coefficients in any abelian group.
Golasinksi, Marek, Lima Goncalves, D.
openaire +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
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
Isomorphism of graph classes related to the circular-ones property [PDF]
, 2012 We give a linear-time algorithm that checks for isomorphism between two 0-1 matrices that obey the circular-ones property. This algorithm leads to linear-time isomorphism algorithms for related graph classes, including Helly circular-arc graphs, \Gamma ...
Curtis, Andrew R. +6 more
core +4 more sources
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