Sciweavers

459 search results - page 34 / 92
» Detecting induced subgraphs
Sort
View
APPROX
2009
Springer
98views Algorithms» more  APPROX 2009»
14 years 3 months ago
Random Tensors and Planted Cliques
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
S. Charles Brubaker, Santosh Vempala
FSTTCS
2009
Springer
14 years 3 months ago
Domination Problems in Nowhere-Dense Classes
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
Anuj Dawar, Stephan Kreutzer
AINA
2008
IEEE
14 years 2 months ago
Structure of the Thai Web Graph
This paper presents structural properties of the Thai Web graph. We conduct an empirical study on the Web graphs induced from two Thai web snapshots crawled during January 2007 (5...
Kulwadee Somboonviwat, Shinji Suzuki, Masaru Kitsu...
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 2 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
ISAAC
2007
Springer
111views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs
In an edge deletion problem one is asked to delete at most k edges from a given graph such that the resulting graph satisfies a certain property. In this work, we study four NP-co...
Jiong Guo