Results 71 to 80 of about 615,797 (257)
Graph Isomorphism Completeness for Trapezoid Graphs
4 pages, 3 Postscript ...
openaire +4 more sources
Beyond Structural Interventions: The Human Architecture Shaping ESG Integration in Corporate Systems
ABSTRACT Despite the promotion of ESG in corporate discourse, substantive integration of ESG principles into business practices remains challenging. This study applies and extends Meadows' leverage framework to examine ESG integration in UAE‐listed firms.
M. Schulte, Dimitris Christopoulos
wiley +1 more source
SH-graph automata with applications [PDF]
In this paper, because semihoops are the most basic residuated structure that contain all logical algebras based on Galois connections, therefore we introduce a new type fuzzy graph and its complement based on semihoops, denoted by $SH$-graph $G$ and $G^\
TianYu Zhang +2 more
doaj +1 more source
Graph Isomorphism for unit square graphs
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show that the Graph Isomorphism Problem for unit square graphs, intersection graphs of axis-parallel unit squares in ...
openaire +6 more sources
Isomorphism Checking of I-graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boris Horvat +2 more
openaire +2 more sources
ABSTRACT Focusing on firm‐size heterogeneity, this study examines how institutional reform reshapes the effects of environmental, social, and governance (ESG) disclosure on firm value. Using 2019–2023 panel data on 1427 Japanese listed firms (before and after the 2022 Tokyo Stock Exchange reorganization and Corporate Governance Code revision), this ...
Akio Nakashima, Kimitaka Nishitani
wiley +1 more source
Subgraph isomorphism in graph classes [PDF]
We investigate the computational complexity of the following restricted variant of Subgraph Isomorphism: given a pair of connected graphs G=(VG,EG) and H=(VH,EH), determine if H is isomorphic to a spanning subgraph of G.
Otachi, Yota +3 more
core +1 more source
Accelerations for Graph Isomorphism
In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two graphs in polynomial time $ O(n^{3}) $.
openaire +2 more sources
Integrating Products, Processes, and Sourcing for Eco‐Innovation
ABSTRACT Eco‐innovation research has often examined regulatory or technological drivers but has paid limited attention to how long‐term organizational change shapes eco‐innovation in mature, resource‐intensive industries. This study addresses that gap by investigating how two leading Finnish pulp and paper firms integrated product, process, and ...
Misa Bakajic, Anand Nair, Markku Kuula
wiley +1 more source
SING: Subgraph search In Non-homogeneous Graphs
Background Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding.
Pulvirenti Alfredo +5 more
doaj +1 more source

