In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a ...

Abstract: Graph contrastive learning (GCL) has gained significant attention in the self-supervised learning field, which aims to ...

Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn ...

Abstract: While generating better negative samples for contrastive learning has been widely studied in the areas of CV and NLP ...