# Induced subgraph

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2013

Highly Cited

2013

- WWW
- 2013

A growing set of on-line applications are generating data that can be viewed as very large collections of small, dense socialâ€¦Â (More)

Is this relevant?

2011

2011

- Discrete Mathematics
- 2011

It is known that a class of graphs defined by a single forbidden induced subgraph G is well-quasi-ordered by the induced subgraphâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- ICML
- 2010

We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph intoâ€¦Â (More)

Is this relevant?

2010

2010

- STACS
- 2010

Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm ofâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- WAW
- 2009

We consider the problem of finding dense subgraphs with specified upper or lower bounds on the number of vertices. We introduceâ€¦Â (More)

Is this relevant?

2007

2007

- Electronic Notes in Discrete Mathematics
- 2007

An s-graph is a graph with two kinds of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graphâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- IEEE Transactions on Knowledge and Dataâ€¦
- 2004

Over the years, frequent itemset discovery algorithms have been used to find interesting patterns in various application areasâ€¦Â (More)

Is this relevant?

2004

2004

- SODA
- 2004

Let <i>H</i> be a fixed graph on <i>h</i> vertices. We say that a graph <i>G</i> is <i>induced H</i>-free if it does not containâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Algorithmica
- 2001

This paper considers the problem of computing the dense k -vertex subgraph of a given graph, namely, the subgraph with the mostâ€¦Â (More)

Is this relevant?

1995

1995

- Journal of Graph Theory
- 1995

Let y(G) and L(G) be the domination number and independent domination number of a graph G, respectively. A graph G is calledâ€¦Â (More)

Is this relevant?