ScholarLens Back to search
2024•Unpublished venueRequires access

Finding the Maximum k- Balanced Biclique on Weighted Bipartite Graphs (Extended abstract)

Yiwei Zhao, Zi Chen, Chen Chen, Xiaoyang Wang, Xuemin Lin, Wenjie Zhang

Open publisher page 2 citations

Abstract

As a popular data structure, bipartite graph is widely used to model the complex relationships between two types of entities widely in many real world application domains[1]. Detecting cohesive subgraphs, such as biclique, is a fundamental problem in graph analysis[2], [3]. Given a bipartite graph$G$, a subgraph$B=(X,\ Y)$is a biclique if$B$is a complete subgraph.

About this research paper

What this paper is about

As a popular data structure, bipartite graph is widely used to model the complex relationships between two types of entities widely in many real world application domains[1]. Detecting cohesive subgraphs, such as biclique, is a fundamental problem in graph analysis[2], [3]. Given a bipartite graph$G$, a subgraph$B=(X,\ Y)$is a biclique if$B$is a complete subgraph.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

As a popular data structure, bipartite graph is widely used to model the complex relationships between two types of entities widely in many real world application domains[1]. Detecting cohesive subgraphs, such as biclique, is a fundamental problem in graph analysis[2], [3]. Given a bipartite graph$G$, a subgraph$B=(X,\ Y)$is a biclique if$B$is a complete subgraph.

Key concepts: Bipartite graph, Complete bipartite graph, Combinatorics, Mathematics, Computer science, Discrete mathematics, Graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Finding the Maximum k- Balanced Biclique on Weighted Bipartite Graphs (Extended abstract) — Research Paper | ScholarLens