Efficient Mining of Maximal Bicliques in Graph by Pruning Search Space

International Journal of Advanced Computer Science and Applications - United Kingdom
doi 10.14569/ijacsa.2020.0110356
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Science and Information Organization

Related search

Enumerating Maximal Bicliques From a Large Graph Using MapReduce

2014English

Full Perfect Extension Pruning for Frequent Graph Mining

2006English

Efficient Maximal Clique Enumeration Over Graph Data

Data Science and Engineering
Computational MechanicsComputer Science Applications
2016English

Mining Maximal Quasi-Bicliques: Novel Algorithm and Applications in the Stock Market and Protein Networks

Statistical Analysis and Data Mining
Computer Science ApplicationsInformation SystemsAnalysis
2009English

Consensus Algorithms for the Generation of All Maximal Bicliques

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2004English

Efficient Pruning of Search Trees in LQR Control of Switched Linear Systems

English

Time and Space Efficient Discovery of Maximal Geometric Graphs

English

Reducing Search Space for Stereo Correspondence With Graph Cuts

2006English

Mining With Constraints by Pruning and Avoiding Ineffectual Processing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy