The relative size of greedy independent sets in sparse and bounded-degree graphs
スポンサーリンク
概要
- 論文の詳細を見る
- 北陸先端科学技術大学院大学の論文
- 1994-01-18
著者
関連論文
- Greed is good : approximating independent sets in sparse and bounded-degree graphs
- On monotone undirected contact networks computing T^n_
- Approximating the chromatic sum of a graph
- The relative size of greedy independent sets in sparse and bounded-degree graphs
- Approximating the minimum maximal independence number
- Approximating set cover via local improvements