Results 21 to 30 of about 42,222 (303)
The social construction of executive pay: governance processes and institutional isomorphism [PDF]
, 2022 Purpose The purpose of this paper is to explore the social construction of executive pay in the UK via an examination of narratives drawn from the social actors on the front-line of Key Management Personnel (KMP) pay determination.
Perkins, S.J., Shortland, S.
core +1 more source
Efficient Streaming Subgraph Isomorphism with Graph NeuralNetworks
, 2021 Queries to detect isomorphic subgraphs are important in graphbased data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do ...
Weidlich, Matthias +5 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
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
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
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
Journal of Symbolic Logic, 1993 If two models of a first-order theory are isomorphic, then they remain isomorphic in any forcing extension of the universe of sets. In general however, such a forcing extension may create new isomorphisms. For example, any forcing that collapses cardinals may easily make formerly nonisomorphic models isomorphic. However, if we place restrictions on the
John T. Baldwin 0001 +2 more
openaire +2 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
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