3 papers
cs.NE2022
Stochastic Neuromorphic Circuits for Solving MAXCUT
Bradley H. Theilman, Yipu Wang, Ojas D. Parekh +3
Finding the maximum cut of a graph (MAXCUT) is a classic optimization problem that has motivated parallel algorithm development. While approximate algorithms to MAXCUT offer attrac…
cs.DS2019
The Single-Face Ideal Orientation Problem in Planar Graphs
Yipu Wang
We consider the ideal orientation problem in planar graphs. In this problem, we are given an undirected graph with positive edge lengths and pairs of distinct vertices $(s_…
cs.CG2018
Topologically Trivial Closed Walks in Directed Surface Graphs
Jeff Erickson, Yipu Wang
Let be a directed graph with vertices and edges, embedded on a surface , possibly with boundary, with first Betti number . We consider the complexity of finding c…