Add to ORKGリサーチレポート（北陸先端科学技術大学院大学情報科学研究科）本文は図書館に配架されています。 / This material is stored in the JAIST library
The independence number of a sparse random graph G(n, m) of average degree d = 2m/n is well-known to...
Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using ...
A well-known result of Ajtai et al. from 1982 states that every $k$-graph $H$ on $n$ vertices, with ...
リサーチレポート（北陸先端科学技術大学院大学情報科学研究科）本文は図書館に配架されています。 / This material is stored in the JAIST library
The minimum-degree greedy algorithm, or Greedy for short, is a simple and well-studied method for fi...
The minimum-degree Greedy algorithm, or Greedy for short, is one of the simplest, most efficient, an...
The minimum-degree Greedy algorithm, or Greedy for short, is one of the simplest, most efficient, an...
International audienceWe study the approximability of the maximum size independent set (MIS) problem...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
We derive new results for the performance of a simple greedy algorithm for finding large independen...
<p>(<b>A</b>) Relative size of maximum -quasi-cliques () in random graphs for (this particular val...
AbstractLet G be a graph on n vertices, let χ(G) denote its chromatic number, and let α(G) denote th...
We present an O *(1.0977 n ) search-tree based exact algorithm for max independent set in graphs ...
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when t...
The independence number of a sparse random graph G(n, m) of average degree d = 2m/n is well-known to...
Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using ...
A well-known result of Ajtai et al. from 1982 states that every $k$-graph $H$ on $n$ vertices, with ...
リサーチレポート（北陸先端科学技術大学院大学情報科学研究科）本文は図書館に配架されています。 / This material is stored in the JAIST library
The minimum-degree greedy algorithm, or Greedy for short, is a simple and well-studied method for fi...
The minimum-degree Greedy algorithm, or Greedy for short, is one of the simplest, most efficient, an...
The minimum-degree Greedy algorithm, or Greedy for short, is one of the simplest, most efficient, an...
International audienceWe study the approximability of the maximum size independent set (MIS) problem...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
Let it (G) be the number of independent sets of size t in a graph G. Engbers and Galvin asked how la...
We derive new results for the performance of a simple greedy algorithm for finding large independen...
<p>(<b>A</b>) Relative size of maximum -quasi-cliques () in random graphs for (this particular val...
AbstractLet G be a graph on n vertices, let χ(G) denote its chromatic number, and let α(G) denote th...
We present an O *(1.0977 n ) search-tree based exact algorithm for max independent set in graphs ...
We consider numbers and sizes of independent sets in graphs with minimum degree at least $d$, when t...
The independence number of a sparse random graph G(n, m) of average degree d = 2m/n is well-known to...
Finding independent sets of maximum size in fixed graphs is well known to be an NP-hard task. Using ...
A well-known result of Ajtai et al. from 1982 states that every $k$-graph $H$ on $n$ vertices, with ...