Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Faster Biclique Mining in Near-Bipartite Graphs   Identifying dense bipartite subgraphs is a common graph data mining task.
Many applications focus on the enumeration of all maximal bicliques (MBs),
though sometimes the stricter variant of maximal induced bicliques (MIBs) is of
interest. Recent work of Kloster et al. introduced a MIB-enumeration approach
designed for "near-bipartite" graphs, where the runtime is parameterized by the
size k of an odd cycle transversal (OCT), a vertex set whose deletion results
in a bipartite graph. Their algorithm was shown to outperform the previously
best known algorithm even when k was logarithmic in |V|. In this paper, we
introduce two new algorithms optimized for near-bipartite graphs - one which
enumerates MIBs in time O(M_I |V||E| k), and another based on the approach of
Alexe et al. which enumerates MBs in time O(M_B |V||E| k), where M_I and M_B
denote the number of MIBs and MBs in the graph, respectively. We implement all
of our algorithms in open-source C++ code and experimentally verify that the
OCT-based approaches are faster in practice than the previously existing
algorithms on graphs with a wide variety of sizes, densities, and OCT
decompositions.

29
The categories of this paper are: funct-an
23
The categories of this paper are: solv-int
28
The categories of this paper are: alg-geom
34
The categories of this paper are: chem-ph
37
The categories of this paper are: supr-con
15
The categories of this paper are: nucl-ex
12
The categories of this paper are: nucl-th
25
The categories of this paper are: patt-sol
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
13
The categories of this paper are: quant-ph
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
31
The categories of this paper are: ao-sci
11
The categories of this paper are: hep-lat
33
The categories of this paper are: plasm-ph