Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
20
click to vote
FSTTCS
2008
Springer
favorite
Email
discuss
report
93
views
Software Engineering
»
more
FSTTCS 2008
»
A new approach to the planted clique problem
13 years 10 months ago
Download
www.math.cmu.edu
Alan M. Frieze, Ravi Kannan
Real-time Traffic
FSTTCS 2008
|
Software Engineering
|
claim paper
Related Content
»
A New Approach for Solving the Maximum Clique Problem
»
Using Constraint Programming to Solve the Maximum Clique Problem
»
A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem
»
CLIQUES A New Approach to Group Key Agreement
»
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
»
New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory
»
Large Maximal Cliques Enumeration in Large Sparse Graphs
»
Quality control of wastewater treatment A new approach
»
Junction tree decomposition for parallel exact inference
more »
Post Info
More Details (n/a)
Added
09 Nov 2010
Updated
09 Nov 2010
Type
Conference
Year
2008
Where
FSTTCS
Authors
Alan M. Frieze, Ravi Kannan
Comments
(0)
Researcher Info
Software Engineering Study Group
Computer Vision