459 search results - page 47 / 92 » Detecting induced subgraphs |
SIAMDM
2008
13 years 8 months ago
2008
Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
MST
2007
13 years 8 months ago
2007
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
SDM
2012
SIAM
11 years 11 months ago
2012
SIAM
Link prediction is an important task in social networks and data mining for understanding the mechanisms by which the social networks form and evolve. In most link prediction rese...
CAEPIA
2003
Springer
14 years 1 months ago
2003
Springer
This paper proposes a diagnosis architecture that integrates consistency based diagnosis with induced time series classifiers, trying to combine the advantages of both methods. Co...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
A graph property is called monotone if it is closed under taking (not necessarily induced) subgraphs (or, equivalently, if it is closed under removal of edges and vertices). Many ...