Stack Exchange
log in
chat
meta
about
Stack Exchange
All Sites
Hot Questions
Top Users
Newsletters
Blogs
Vinicius dos Santos
Brazil
dcc.ufrj.br/~viniciussantos
Age: 28
top
accounts
reputation
activity
favorites
subscriptions
Top Questions
21
votes
Relation between hardness of recognition of a graph class and forbidden subgraph characterization
cc.complexity-theory
graph-theory
np-hardness
asked Jul 2 '11 at 0:06
cstheory.stackexchange.com
18
votes
Is there a problem that is easy for cubic graph but hard for graphs with maximum degree 3?
graph-theory
graph-algorithms
np-hardness
asked Nov 24 '12 at 16:39
cstheory.stackexchange.com
11
votes
References for Modular Decomposition
ds.algorithms
reference-request
graph-theory
graph-algorithms
asked Apr 14 '11 at 3:01
cstheory.stackexchange.com
9
votes
Complexity of finding a graph separator with a given property
ds.algorithms
graph-theory
graph-algorithms
asked Mar 7 '12 at 16:03
cstheory.stackexchange.com
Top Answers
10
Hardness of additive approximation to Graph Coloring problem.
cstheory.stackexchange.com
8
Find all nearby points in a set, for each element of the set
cstheory.stackexchange.com
6
What Lecture Notes Should Everyone Read?
cstheory.stackexchange.com
5
Which Integer Linear Programs are easy?
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled
cstheory.stackexchange.com
