2 papers
math.CO2025
Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian
Sihong Shao, Yuxuan Wu
We prove that every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian, and show that the 6-face condition is tight. Our results push the connectivity con…
cs.LG2024
Bi-Directional Multi-Scale Graph Dataset Condensation via Information Bottleneck
Xingcheng Fu, Yisen Gao, Beining Yang +4
Dataset condensation has significantly improved model training efficiency, but its application on devices with different computing power brings new requirements for different data…