학술
기타
On the CGGRT Criterion for Detecting Bipartite Perfect Matchings in NC
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
The recent breakthrough work of Chatterjee, Ghosh, Gurjar, Raj and Thierauf [CGGRT26] gives the first deterministic NC algorithm for the bipartite matching problem.
They show how to detect as well as find perfect matchings in bipartite graphs in NC.
In this note we present an arguably simpler-to-state variation of the NC detection criterion of [CGGRT26], with improved parameters.
이 뉴스, 어떠셨어요?
탭 한 번으로 반응 · 로그인 불필요
관련 뉴스
관련 뉴스 제보는 로그인 후 가능합니다.
'research' 카테고리 뉴스
The strip-shaped deep white matter hyperintensities may be related to neurodegeneration: A study based on diffusion tensor imaging
PLOS ONE
Data-driven analysis of heterogeneous gait subgroups and ground reaction forces based on integrated center of pressure–center of mass dynamics in poststroke hemiparesis
PLOS ONE
Correction: Study on plugging law and plugging removal effect of pre filled screen in natural gas hydrate argillaceous silt reservoir
PLOS ONE