OpenAlex
PricingAboutJobs
Log inGet started
Work

On maximum clique problems in very large graphs

HTML

Year: 1999
Type: book-chapter
Source: DIMACS series in discrete mathematics and theoretical computer science
Parent work: External Memory Algorithms
DOI: 10.1090/dimacs/050/06
Authors: J. Abello, Panos Pardalos, M. Resende
Institution: AT&T (United States)
Language: English

Topic: Graph Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: maximum clique problem, graph decomposition, greedy randomized adaptive search procedure, approximate solutions, sparse graphs, telecommunications networks, graph structure analysis

Open Access status: closed
OpenAlex ID: W106934005
FWCI: 8.441
Cites: 13
Cited by: 262
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