z-logo
open-access-imgOpen Access
Lexicographic Breadth First-Search and Branch and Bound Algorithms for the Maximum Clique Problem
Author(s) -
Matheus Millen Corrêa,
Renato Carmo,
Alexandre Prusch Züge
Publication year - 2022
Publication title -
matemática contemporânea
Language(s) - English
Resource type - Journals
eISSN - 2317-6636
pISSN - 0103-9059
DOI - 10.21711/231766362021/rmc4824
Subject(s) - lexicographical order , branch and bound , clique , clique problem , computer science , combinatorics , algorithm , mathematics , chordal graph , graph , 1 planar graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom