An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem-Reference-Cited by-同舟云学术

An Exact Branch and Bound Algorithm with Symmetry Breaking for the Maximum Balanced Induced Biclique Problem

Published:2014 Issue: Volume: Page:226-234
ISSN:0302-9743
Container-title:Integration of AI and OR Techniques in Constraint Programming
language:
Short-container-title:

Author:

McCreesh Ciaran,Prosser Patrick

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-07046-9_16

Reference16 articles.

1. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)

2. San Segundo, P., Rodríguez-Losada, D., Jiménez, A.: An exact bit-parallel algorithm for the maximum clique problem. Comput. Oper. Res. 38(2), 571–581 (2011)

3. San Segundo, P., Matia, F., Rodríguez-Losada, D., Hernando, M.: An improved bit parallel exact maximum clique algorithm. Optimization Letters (2011)

4. Crawford, J., Ginsberg, M., Luks, E., Roy, A.: Symmetry-breaking predicates for search problems. In: KR 1996: Principles of Knowledge Representation and Reasoning, pp. 148–159. Morgan Kaufmann (1996)

5. Gent, I.P., Petrie, K.E., François Puget, J.: Symmetry in constraint programming. In: Handbook of Constraint Programming, pp. 329–376. Elsevier (2006)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bipartite Graph Analytics: Current Techniques and Future Trends;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

2. Efficient Personalized Maximum Biclique Search;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05

3. Maximum and top-k diversified biclique search at scale;The VLDB Journal;2022-04-18

4. Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs;IEEE Transactions on Knowledge and Data Engineering;2022

5. Comparison Analysis;Cohesive Subgraph Search Over Large Heterogeneous Information Networks;2022