2 citations · 6 across the 6 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math-ph2022★ 1 cited
Solving the n-color ice model
Patrick Addona, Ethan Bockenhauer, Ben Brubaker +14
Given an arbitrary choice of two sets of nonzero Boltzmann weights for -color lattice models, we provide explicit algebraic conditions on these Boltzmann weights which guarantee…
cs.AI2022★ 1 cited
Hybrid Learning with New Value Function for the Maximum Common Subgraph Problem
Yanli Liu, Jiming Zhao, Chu-Min Li +2
Maximum Common induced Subgraph (MCS) is an important NP-hard problem with wide real-world applications. Branch-and-Bound (BnB) is the basis of a class of efficient algorithms for…
cs.DS2022★ 2 cited
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
Jianrong Zhou, Kun He, Jiongzhi Zheng +2
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) a…