Maximum cut

For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the Max-Cut Problem.

The problem can be stated simply as follows. One wants a subset S of the vertex set such that the number of edges between S and the complementary subset is as large as possible.

单词	Maximum cut
释义	Maximum cut 英语百科 Maximum cut For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the Max-Cut Problem. The problem can be stated simply as follows. One wants a subset S of the vertex set such that the number of edges between S and the complementary subset is as large as possible.
随便看	granulomatous keratopathy granulomatous laryngitis granulomatous lung disease granulomatous lymphoma Granulomatous macrocheilitis Granulomatous meningoencephalitis granulomatous mural endocarditis granulomatous myocarditis granulomatous nocardiosis granulomatous orchitis Granulomatous peritonitis granulomatous pneumonia granulomatous pneumonitis Granulomatous polyp granulomatous prostadtitis Granulomatous prostatitis Granulomatous reaction Granulomatous retinitis granulomatous rhinitis granulomatous rosacea granulomatous rosacea,lupoid rosacea,papular rosacea Granulomatous sarcoid nephropathy granulomatous scleritis Granulomatous slack skin granulomatous staphylococcal mastitis