𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating minimum coloring and maximum independent set in dotted interval graphs

✍ Scribed by Minghui Jiang

Book ID
108153441
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
78 KB
Volume
98
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximating Coloring and Maximum Indep
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
✍ Michael Krivelevich; Ram Nathaniel; Benny Sudakov πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 120 KB

We discuss approximation algorithms for the coloring problem and the maximum independent set problem in 3-uniform hypergraphs. An algorithm for coloring ˜1r5 Ε½ . ## 3-uniform 2-colorable hypergraphs in O n colors is presented, improving previously known results. Also, for every fixed β₯ ) 1r2, we

Graphs with unique minimum edge dominati
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
✍ Jerzy Topp πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 816 KB

Topp, J., Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices, Discrete Mathematics 12 1 (1993) 199-210. A set I of vertices of a graph G is an independent set if no two vertices of I are adjacent. A set M of edges of G is an edge dominating s