Sciweavers

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

90

WADS
2007
Springer

78views Algorithms» more WADS 2007»

Independent Sets in Bounded-Degree Hypergraphs

15 years 9 months ago

Independent Sets in Bounded-Degree Hypergraphs

Download www.ru.is

Magnús M. Halldórsson, Elena Losievs

Real-time Traffic

Algorithms | WADS 2007 |

claim paper

Related Content

» The Complexity of Approximating BoundedDegree Boolean CSP

» 3hitting set on Bounded Degree Hypergraphs Upper and Lower Bounds on the Kernel Size

» Improved Approximations of Independent Sets in BoundedDegree Graphs

» Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs

» PTAS for maximum weight independent set problem with random weights in bounded degree grap...

» Finding and counting cliques and independent sets in runiform hypergraphs

» Induced Subgraphs of Bounded Degree and Bounded Treewidth

» On Constant Time Approximation of Parameters of Bounded Degree Graphs

» Extremal Problems For Transversals In Graphs With Bounded Degree

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WADS
Authors	Magnús M. Halldórsson, Elena Losievskaja

Comments (0)