Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

100

Voted

ISAAC
1993
Springer

134views Algorithms» more ISAAC 1993»

Weighted Independent Perfect Domination on Cocomparability Graphs

15 years 6 months ago

Weighted Independent Perfect Domination on Cocomparability Graphs

Download publications.cse.iitm.ac.in

Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg

Real-time Traffic

Algorithms | ISAAC 1993 |

claim paper

Related Content

» Upper domination and upper irredundance perfect graphs

» Inexpensive ddimensional matchings

» Trapezoid Graphs and Generalizations Geometry and Algorithms

» Efficient Algorithms for the Domination Problems on Interval and CircularArc Graphs

» RentorBuy Scheduling and Cost Coloring Problems

» Local Graph Partitions for Approximation and Testing

» ConstantTime Approximation Algorithms via Local Improvements

» Parameterized Learning Complexity

» Structuring unreliable radio networks

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1993
Where	ISAAC
Authors	Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg

Comments (0)