Results 111 to 120 of about 6,246 (257)

Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth [PDF]

, 2020
We extend Babai’s quasipolynomial-time graph isomorphism test (STOC 2016) and develop a quasipolynomial-time algorithm for the multiple-coset isomorphism problem.
Wiebking, Daniel
core   +1 more source

Graph Theory Students’ Perceptions of Graph Isomorphism [PDF]

Iranian Journal of Educational Research
Objective: Graph isomorphism is a central topic in graph theory, yet students often struggle to grasp its underlying principles. This study aimed to explore students' perceptions of graph isomorphism and identify the conceptual metaphors they employ when
Ali Jafari, Majid Haghverdi, Abolfazl Tehranian   +2 more
doaj  

Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders

International Journal of Mathematics and Mathematical Sciences, 2008
We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp ...
Salah Al-Addasi, Hasan Al-Ezeh
doaj   +1 more source

Analysis of the relationship between firm innovation and corporate social responsibility: A systematic literature review

European Management Review, EarlyView.
Abstract Firm innovation and corporate social responsibility (CSR) are key strategic considerations that shape a firm's competitiveness and sustainability. However, studies exploring the relationship between the two are heterogeneous and sometimes obtain contradictory results, making it difficult to draw clear conclusions.
Daniel Alonso‐Martínez, Laura Cabeza‐García, Santiago Mencías‐Calderón   +2 more
wiley   +1 more source

On n-skein isomorphisms of graphs

Journal of Combinatorial Theory, Series B, 1982
AbstractH. Whitney [Amer. J. Math. 54 (1932), 150–168] proved that edge isomorphisms between connected graphs with at least five vertices are induced by isomorphisms and that circuit isomorphisms between 3-connected graphs are induced by isomorphisms. R. Halin and H. A. Jung [J. London Math. Soc. 42 (1967), 254–256] generalized these results by showing
Robert L. Hemminger, Heinz Adolf Jung
openaire   +1 more source

Pairwise Imitation and Tournament Graphs

International Economic Review, EarlyView.
ABSTRACT This paper investigates strategic dynamics under the behavioral rule of pairwise interact and imitate (PII), which requires minimal information and emphasizes outperforming opponents in pairwise interactions. We characterize PII using weak tournament graphs and, for a broad class of dynamics, establish a one‐shot stability result for ...
Sung‐Ha Hwang, Philip R. Neary, Jonathan Newton, Ryoji Sawa   +3 more
wiley   +1 more source

The distinctive incorporation of sociological neoinstitutionalism into Japanese sociology and its theoretical insights for the discipline

Japanese Journal of Sociology, Volume 34, Issue 1, Page 206-223, March 2025.
Abstract Although sociological neoinstitutionalist thought has made indelible imprints across the social sciences in Japan, its incorporation into Japanese sociology at large has been relatively limited, and its broader applications to analyses of global social phenomena using World Society Theory are even less prominent.
Ralph I. Hosoki
wiley   +1 more source

Graph isomorphism for graph classes characterized by two forbidden induced subgraphs

, 2016
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs.
Schweitzer, Pascal, Kratsch, Stefan
core   +1 more source

Portable network resolving huge-graph isomorphism problem

Machine Learning: Science and Technology
The graph isomorphism, as a key task in graph data analysis, is of great significance for the understanding, feature extraction, and pattern recognition of graph data.
Xin An, Ling-Fang Li, Xue Yang, Ming-Xing Luo   +3 more
doaj   +1 more source

On Spatial Point Processes With Composition‐Valued Marks

International Statistical Review, EarlyView.
Summary Methods for marked spatial point processes with scalar marks have seen extensive development in recent years. While the impressive progress in data collection and storage capacities has yielded an immense increase in spatial point process data with highly challenging non‐scalar marks, methods for their analysis are not equally well developed ...
Matthias Eckardt, Mari Myllymäki, Sonja Greven   +2 more
wiley   +1 more source