Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
In this paper, we propose a community detection scheme in an integrated Internet of Things (IoT) and Social Network (SN… 
2011
2011
Continued scaling of process technologies is critical to sustaining improvements in processor frequencies and performance… 
2010
2010
At the heart of modern coding theory lies the fact that low-density parity-check (LDPC) codes can be efficiently decoded by… 
2008
2008
The paper studies a class of formation control problem, i.e. the controllability for multi-agent systems under leader-follower… 
Highly Cited
2007
Highly Cited
2007
This paper presents the results of LILY, which is an ontology mapping system, for OAEI 2007 campaign. To accurately describe what… 
2006
2006
Given a graph G = (V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset… 
2003
2003
For an integer $s\ges 2$, a property $\P^{(s)}$ is an infinite class of s-uniform hypergraphs closed under isomorphism. We say… 
1999
1999
This paper reports design and preliminary evaluation of an integrated load distribution-load balancing algorithm which was…