Results 201 to 210 of about 21,959 (221)

The ultrametric backbone is the union of all minimum spanning forests. [PDF]

J Phys Complex
Rozum JC, Rocha LM.
europepmc   +1 more source

Color-coding methods for finding subgraph isomorphisms

Arnšek, Tit
openalex   +1 more source

Rigidity of Symmetric Frameworks on the Cylinder. [PDF]

Discrete Comput Geom
Nixon A, Schulze B, Wall J.
europepmc   +1 more source

Percolation for 2D Classical Heisenberg Model and Exit Sets of Vector Valued GFF. [PDF]

Commun Math Phys
Aru J, Garban C, Sepúlveda A.
europepmc   +1 more source

SkyMap: a generative graph model for GNN benchmarking. [PDF]

Front Artif Intell
Wassington A, Higueras R, Abadal S.
europepmc   +1 more source

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs [PDF]

Mohammad Dindoost, Oliver Alvarado Rodriguez, Bartosz Bryg, Ioannis Koutis, David A. Bader   +4 more
openalex  

Some of the next articles are maybe not open access.

Related searches:

Exploiting Isomorphic Subgraphs in SAT

2021
While static symmetry breaking has been explored in the SAT community for decades, only as of 2010 research has focused on exploiting the same discovered symmetry dynamically, during the run of the SAT solver, by learning extra clauses. The two methods are distinct and not compatible.
Ivrii, Alexander, Strichman, Ofer
openaire   +1 more source

VF2++—An improved subgraph isomorphism algorithm

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jüttner, Alpár, Madarasi, Péter
openaire   +2 more sources