Detecting induced subgraphs

Overview of attention for article published in Discrete Applied Mathematics, October 2009

Altmetric Badge

About this Attention Score

Good Attention Score compared to outputs of the same age (71st percentile)
Average Attention Score compared to outputs of the same age and source

Mentioned by

twitter: 2 X users

q&a: 2 Q&A threads

Readers on

mendeley: 13 Mendeley

So far, Altmetric has seen 2 Q&A posts from 2 users.

Relation between hardness of recognition of a graph class and forbidden subgraph characterization

Posted by Vinicius dos Santos, at cstheory.stackexchange.com, 02 Jul 2011

I'm considering graph classes that can be characterized by forbidden subgraphs. If a graph class has a finite set of forbidden…

Hardness jumps in computational complexity?

Posted by Mohammad Al-Turkistany, at cstheory.stackexchange.com, 24 Oct 2010

Minimum bandwidth problem is to a find an ordering of graph nodes on integer line that minimizes the largest distance between…

This page shows the most recent Q&A posts that mention this research output. Click here to find out how to access more activity.