Sciweavers

206 search results - page 4 / 42
» New Data Structures for Subgraph Connectivity
Sort
View
71
Voted
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
15 years 10 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
104
Voted
GCB
2007
Springer
161views Biometrics» more  GCB 2007»
15 years 3 months ago
High-Precision Function Prediction using Conserved Interactions
: The recent availability of large data sets of protein- protein-interactions (PPIs) from various species offers new opportunities for functional genomics and proteomics. We descri...
Samira Jaeger, Ulf Leser
ICPR
2002
IEEE
15 years 10 months ago
A New Algorithm for Inexact Graph Matching
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
Adel Hlaoui, Shengrui Wang
94
Voted
PVLDB
2010
200views more  PVLDB 2010»
14 years 8 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin
94
Voted
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
14 years 11 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner