Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Wei Liang

Wei Liang

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1

Frequent co-authors

Quanlong Niu1×
Riheng Jia1×
Zhao Zhang1×

Research Timeline

2026
An Exact Polynomial-Time Algorithm for the Minimum Shared-Power Edge Cut Problem

The paper presents an exact polynomial-time algorithm for the Minimum Shared-Power Edge Cut problem.

Highlighted terms show continued research focus across papers

Papers

cs.DSTheoreticalRecentOct 20, 2026

An Exact Polynomial-Time Algorithm for the Minimum Shared-Power Edge Cut Problem

Quanlong Niu, Wei Liang, Riheng Jia, Zhao Zhang

The paper presents an exact polynomial-time algorithm for the Minimum Shared-Power Edge Cut problem.

View →