Induced subgraph

In graph theory, an induced subgraph of a graph is another graph, formed from a subset of the vertices of the graph and all of the edges connecting… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
A growing set of on-line applications are generating data that can be viewed as very large collections of small, dense social… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
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)
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into… (More)
  • figure 1
  • table 2
  • table 1
Is this relevant?
2010
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
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
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Over the years, frequent itemset discovery algorithms have been used to find interesting patterns in various application areas… (More)
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
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
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
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?