AI helps you reading Science

AI generates interpretation videos

AI extracts and analyses the key points of the paper to generate videos automatically


pub
Go Generating

AI Traceability

AI parses the academic lineage of this thesis


Master Reading Tree
Generate MRT

An efficient exact algorithm for constraint bipartite vertex cover

Mathematical Foundations of Computer Science, no. 2 (2001): 374-410

Cited by: 61|Views3
EI

Abstract

The "Constraint Bipartite Vertex Cover" problem (CBVC for short) is: given a bipartite graph G with n vertices and two positive integers k1, k2, is there a vertex cover taking at most k1 vertices from one and at most k2 vertices from the other vertex set of G? CBVC is NP-complete. It formalizes the spare allocation problem for reconfigura...More

Code:

Data:

Your rating :
0

 

Tags
Comments
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科