January 01, 2003 conference-paper An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique Lecture notes in computer science DOI: 10.1007/3-540-45066-1_22 OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 206 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access An efficient local search algorithm for solving maximum edge weight clique problem in large graphs 2020 Journal of Combinatorial Optimization article Computer Science Complexity and Algorithms in Graphs 7 citations 1 result References 0