Search Sciweavers | Sciweavers

252 search results - page 8 / 51

» Decremental Clique Problem

click to vote

WG
1998
Springer

125views Theoretical Computer Science» more WG 1998»

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

15 years 1 months ago

Download www.labri.fr

Hierarchical decompositions of graphs are interesting for algorithmic purposes. There are several types of hierarchical decompositions. Tree decompositions are the best known ones....

Bruno Courcelle, Johann A. Makowsky, Udi Rotics

claim paper

Read More »

click to vote

AAIM
2006
Springer

101views Algorithms» more AAIM 2006»

A New Approach for Solving the Maximum Clique Problem

15 years 3 months ago

Download www.scs.carleton.ca

Peter J. Taillon

claim paper

Read More »

click to vote

SAC
1998
ACM

161views Applied Computing» more SAC 1998»

A simple heuristic based genetic algorithm for the maximum clique problem

15 years 1 months ago

Download www.cs.ru.nl

Elena Marchiori

claim paper

Read More »

click to vote

FSTTCS
2008
Springer

93views Software Engineering» more FSTTCS 2008»

A new approach to the planted clique problem

14 years 10 months ago

Download www.math.cmu.edu

Alan M. Frieze, Ravi Kannan

claim paper

Read More »

click to vote

ALGORITHMICA
2010

85views more ALGORITHMICA 2010»

An Efficient Algorithm for Solving Pseudo Clique Enumeration Problem

14 years 9 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers