OpenAlex
PricingAboutJobs
Log inGet started
Work

An Efficient Implicit Enumeration Algorithm for the Maximum Clique Problem

HTML

Year: 1988
Type: book-chapter
Source: Lecture notes in economics and mathematical systems
Parent work: Advances in Optimization and Control
DOI: 10.1007/978-3-642-46629-8_6
Authors: Michel Gendreau, Jean-Claude Picard, Lourdes Zubieta
Institutions: Polytechnique Montréal, Université de Montréal, Université du Québec à Montréal
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: maximum clique problem, implicit enumeration, depth-first search, branching rules, triangle count, clique enumeration, sparse graphs, combinatorial optimization

Open Access status: closed
OpenAlex ID: W2162164123
FWCI: 3.006
Cites: 15
Cited by: 15
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security