Results 121 to 130 of about 6,246 (257)
Subgraph isomorphism in graph classes
, 2012 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
Size of the memory for storage of ordered rooted graph
Труды Института системного программирования РАН, 2018 The paper considers boundaries of memory necessary and sufficient for storage of undirected ordered rooted connected graphs, both numbered and unnumbered. The introduction contains the basic definitions and the problem statement. A graph is rooted if one
I. B. Burdonov, A. S. Kossatchev
doaj +1 more source
Tax Incentives for Small and Medium–Sized Enterprises: A Systematic Literature Review
Journal of Economic Surveys, EarlyView.ABSTRACT This paper presents a PRISMA‐guided systematic literature review of 91 studies analyzing tax incentives for small and medium‐sized enterprises (SMEs) and their stakeholders. Adopting an SME‐specific, instrument‐agnostic perspective, spanning both firm‐side and investor‐side incentives across multiple tax instruments, we identify three patterns.
Adam Lynch +2 more
wiley +1 more source
Journal of Management Studies, EarlyView.Abstract This study advances research on organizational legitimacy by examining the microlevel mechanisms through which evaluators form propriety beliefs. Building on legitimacy‐as‐perception research, which posits that evaluators rely on validity cues to make judgments, we argue that individual evaluators draw on broader, more nuanced sets of ...
Julia Thaler +3 more
wiley +1 more source
The Isomorphism between Graphs and their Adjoint Graphs [PDF]
Canadian Mathematical Bulletin, 1965 A graph G is defined as a set X = {x1, …, xn} of elements xi called vertices, and a collection Γ of (not necessarily distinct) unordered pairs of distinct vertices, called edges. An edge (xi, xj) is said to be incident to xi and xj which are its end-vertices.
openaire +2 more sources
On Isomorphisms of Finite Cayley Graphs
European Journal of Combinatorics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marston D. E. Conder, Cai Heng Li
openaire +1 more source
Embedding mental files in the world
Mind &Language, EarlyView.Cognitive scientific explanations can take either a mechanistic or design perspective. Some recent philosophical works propose to apply the mechanistic perspective to the influential mental file framework. The design perspective, however, remains underexplored.
Zhengxi Jin
wiley +1 more source
Distributed Graph Simulation: Impossibility and Possibility
, 2014 This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin +3 more
core
Investigating Hypernode Classification of Complex Systems Based on High-order Graph Neural Networks
Guidance, Navigation and ControlInvestigating latent interactions beyond direct connections is essential for analyzing complex networks. However, traditional graph structures often fail to capture complex relationships, especially in the high-order interactions among multiple ...
Jiawen Chen +3 more
doaj +1 more source
Nilpotent graphs with crosscap at most two
AKCE International Journal of Graphs and Combinatorics, 2018 Let be a commutative ring with identity. The nilpotent graph of , denoted by , is a graph with vertex set , and two vertices and are adjacent if and only if is nilpotent, where .
A. Mallika, R. Kala
doaj +1 more source