Narrow search
Showing 1 - 6 of 6
Cover Image
Exact algorithms for the minimum s-club partitioning problem
Yezerska, Oleksandra; Mahdavi Pajouh, Foad; Veremyev, … - In: Computational biomedicine, (pp. 267-291). 2019
Persistent link: https://www.econbiz.de/10012017790
Cover Image
Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes
Balasundaram, Balabhaskar; Chandramouli, Shyam Sundar; … - In: Optimization letters 4 (2010) 3, pp. 311-320
Persistent link: https://www.econbiz.de/10003982631
Cover Image
Detecting a most closeness-central clique in complex networks
Nasirian, Farzaneh; Mahdavi Pajouh, Foad; Balasundaram, … - In: European journal of operational research : EJOR 283 (2020) 2, pp. 461-475
Persistent link: https://www.econbiz.de/10012294843
Cover Image
Algorithms for the maximum k-club problem in graphs
Shahinpour, Shahram; Butenko, Sergiy - In: Journal of combinatorial optimization 26 (2013) 3, pp. 520-554
Persistent link: https://www.econbiz.de/10010204553
Cover Image
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag; Buchanan, Austin; Butenko, Sergiy - In: INFORMS journal on computing : JOC 27 (2015) 1, pp. 164-177
Persistent link: https://www.econbiz.de/10010505031
Cover Image
A lagrangian bound on the clique number and an exact algorithm for the maximum edge weight clique problem
Hosseinian, Seyedmohammadhossein; Fontes, Dalila B. M. M.; … - In: INFORMS journal on computing : JOC 32 (2020) 3, pp. 747-762
Persistent link: https://www.econbiz.de/10012294726