2005•Yunnan Daxue xuebao. Shehui kexue banRequires access

Partition problems of bipartite graphs

Jianping Li

Abstract

Abstrcat|V|-K_(1,m) partition problems of bipartite graphs were considered.A polynomial algorithm was given for this problem by Maximum-flow algorithm and minimum-cost algorithm,and it was proved to be a O((|V|+|U|)~3) algorithm when on unweighted or equal-weight bipartite graphs.The min-max |V|-K_(1,m) partition problems of weighted bipartite graphs was proved to be NP-hard.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Bipartite graph, Partition (number theory), Combinatorics, Mathematics, Partition problem, Graph partition, Complete bipartite graph, Frequency partition of a graph