Sciweavers

204 search results - page 17 / 41
» Testing Triangle-Freeness in General Graphs
Sort
View
JCT
2008
81views more  JCT 2008»
13 years 7 months ago
Algebraic characterization of uniquely vertex colorable graphs
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
Christopher J. Hillar, Troels Windfeldt
CLEF
2007
Springer
14 years 1 months ago
Multiplying Concept Sources for Graph Modeling
This paper presents the LIG contribution to the CLEF 2007 medical retrieval task (i.e. ImageCLEFmed). The main idea in this paper is to incorporate medical knowledge in the langua...
Loïc Maisonnasse, Éric Gaussier, Jean-...
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Detecting research topics via the correlation between graphs and texts
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
Yookyung Jo, Carl Lagoze, C. Lee Giles
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 11 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu
ISSTA
2009
ACM
14 years 2 months ago
Identifying bug signatures using discriminative graph mining
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...