中文
相关论文

相关论文: Game of Life on Graphs

200 篇论文

For many graph-related problems, it can be essential to have a set of structurally diverse graphs. For instance, such graphs can be used for testing graph algorithms or their neural approximations. However, to the best of our knowledge, the…

机器学习 · 计算机科学 2024-12-13 Fedor Velikonivtsev , Mikhail Mironov , Liudmila Prokhorenkova

We study characteristics which might distinguish two-graphs by introducing different numerical measures on the collection of graphs on $n$ vertices. Two conjectures are stated, one using these numerical measures and the other using the deck…

组合数学 · 数学 2008-10-20 David M. Duncan , Thomas R. Hoffman , James P. Solazzo

We consider zero-sum games in which players move between adjacent states, where in each pair of adjacent states one state dominates the other. The states in our game can represent positional advantages in physical conflict such as high…

计算机科学与博弈论 · 计算机科学 2024-07-11 Farid Arthaud , Edan Orzech , Martin Rinard

Evolutionary graph theory is a well established framework for modelling the evolution of social behaviours in structured populations. An emerging consensus in this field is that graphs that exhibit heterogeneity in the number of connections…

种群与进化 · 定量生物学 2018-11-20 Wes Maciejewski , Feng Fu , Christoph Hauert

Understanding and interacting with everyday physical scenes requires rich knowledge about the structure of the world, represented either implicitly in a value or policy function, or explicitly in a transition model. Here we introduce a new…

Conway's Game of Life is the best-known cellular automaton. It is a classic model of emergence and self-organization, it is Turing-complete, and it can simulate a universal constructor. The Game of Life belongs to the set of semi-totalistic…

神经与进化计算 · 计算机科学 2021-06-11 Peter D. Turney

We report the current state of the graph isomorphism problem from the practical point of view. After describing the general principles of the refinement-individualization paradigm and proving its validity, we explain how it is implemented…

离散数学 · 计算机科学 2013-01-09 Brendan D. McKay , Adolfo Piperno

We define a range of new coarse geometric invariants based on various graph-theoretic measures of complexity for finite graphs, including: treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these…

度量几何 · 数学 2025-08-07 Wanying Huang , David Hume , Samuel J. Kelly , Ryan Lam

Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…

计算物理 · 物理学 2026-04-10 Sara Najem , Amer E. Mouawad

This work is concerned with the study of the Game of Graph Nim -- a class of two-player combinatorial games -- on graphs with $4$ edges. To each edge of such a graph is assigned a positive-integer-valued edge-weight, and during each round…

组合数学 · 数学 2025-09-08 Sayar Karmakar , Moumanti Podder , Souvik Roy , Soumyarup Sadhukhan

This chapter discusses the interplay between structure and dynamics in complex networks. Given a particular network with an endowed dynamics, our goal is to find partitions aligned with the dynamical process acting on top of the network. We…

社会与信息网络 · 计算机科学 2020-05-08 Michael T. Schaub , Jean-Charles Delvenne , Renaud Lambiotte , Mauricio Barahona

A method for improving the efficiency of graph isomorphism testing is presented. The method uses the structure of the graph colored by vertex hash codes as a means of partitioning vertices into equivalence classes, which in turn reduces the…

数据结构与算法 · 计算机科学 2016-06-02 Thomas E. Portegys

We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations.…

神经与进化计算 · 计算机科学 2007-05-23 V. C. Barbosa , L. C. D. Campos

We present a method to extract temporal hypergraphs from sequences of 2-dimensional functions obtained as solutions to Optimal Transport problems. We investigate optimality principles exhibited by these solutions from the point of view of…

离散数学 · 计算机科学 2023-01-10 Diego Baptista , Caterina De Bacco

We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.

计算复杂性 · 计算机科学 2008-01-10 Shmuel Friedland

Symmetry is an important aesthetic criteria in graph drawing and network visualisation. Symmetric graph drawings aim to faithfully represent automorphisms of graphs as geometric symmetries in a drawing. In this paper, we design and…

数据结构与算法 · 计算机科学 2019-10-14 Amyra Meidiana , Seok-Hee Hong , Peter Eades , Daniel Keim

We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial…

计算复杂性 · 计算机科学 2019-03-19 Anuj Dawar , Kashif Khan

The central nervous system is composed of many individual units -- from cells to areas -- that are connected with one another in a complex pattern of functional interactions that supports perception, action, and cognition. One natural and…

神经元与认知 · 定量生物学 2017-04-03 Ann E. Sizemore , Danielle S. Bassett

Graphs are fundamental objects that find widespread applications across computer science and beyond. Graph Theory has yielded deep insights about structural properties of various families of graphs, which are leveraged in the design and…

数据结构与算法 · 计算机科学 2023-08-30 Rachit Nimavat

Large-scale graphs are widely used to represent object relationships in many real world applications. The occurrence of large-scale graphs presents significant computational challenges to process, analyze, and extract information. Graph…

社会与信息网络 · 计算机科学 2019-10-11 Yu Jin , Andreas Loukas , Joseph F. JaJa