Biclique completion problems for multicast network design-Reference-Cited by-同舟云学术

Biclique completion problems for multicast network design

Published:2007-12 Issue:3-4 Volume:4 Page:360-377
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Faure Nathalie,Chrétienne Philippe,Gourdin Eric,Sourd Francis

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference18 articles.

1. N. Amit, The Bicluster Graph Editing Problem, MSc Thesis, Tel Aviv University, 2004

2. Aggregated Multicast — A Comparative Study;Cui;Cluster Computing: The Journal of Networs, Software and Applications,2003

3. J.H. Cui, L. Lao, D. Maggiorini, M. Gerla, BEAM: A Distributed Aggregated Multicast Protocol Using Bi-directional Trees, in: IEEE International conference on communications. 2003

4. M. Dawande, P. Keskinocak, S. Tayur, On the biclique problem in bipartite graphs, GSIA Working Paper 1996-04, Carnegie Mellon University, Pittsburgh, PA 15213, USA, 1996

5. The PIM architecture for wide-area multicast routing;Deering;IEEE/ACM Transactions on Networking,1996

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

1. A Population-Based Algorithm for the k-Clustering Minimum Biclique Completion Problem;2022 8th International Conference on Control, Decision and Information Technologies (CoDIT);2022-05-17

2. A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem;Journal of the Operational Research Society;2022-02-21

3. Algorithm of Finding All Maximal Induced Bicliques of Hypergraph;Communications in Computer and Information Science;2022

4. Effect of Local Branching on the Iterative Rounding-Based Method: The Case of k-Clustering Minimum Completion Problems;Cybernetics and Systems;2021-12-02

5. The biclique partitioning polytope;Discrete Applied Mathematics;2021-10