28 search results - page 3 / 6 » Algorithms for clique-independent sets on subclasses of circ... |
FUN
2007
Springer
14 years 13 days ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
FSTTCS
2010
Springer
13 years 6 months ago
2010
Springer
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
ISNN
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, a space partition method called “Label Constrained Graph Partition” (LCGP) is presented to solve the Sample-InterweavingPhenomenon in the original space. We firs...
COMBINATORICA
2008
13 years 8 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
SWAT
1994
Springer
14 years 18 days ago
1994
Springer
Trapezoid graphs are a class of cocomparability graphs containing interval graphs and permutation graphs as subclasses. They were introduced by Dagan, Golumbic and Pinter DGP]. Th...