Sciweavers

154 search results - page 2 / 31
» Odd subgraphs and matchings
Sort
View
VLDB
2012
ACM
361views Database» more  VLDB 2012»
12 years 25 days ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...
TCBB
2011
13 years 6 days ago
Graph Comparison by Log-Odds Score Matrices with Application to Protein Topology Analysis
A TOPS diagram is a simplified description of the topology of a protein using a graph where nodes are α-helices and β-strands, and edges correspond to chirality relations and p...
J. Rocha
ARSCOM
2007
82views more  ARSCOM 2007»
13 years 5 months ago
Extremal properties of (1, f)-odd factors in graphs
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
Qinglin Roger Yu, Zhao Zhang
SIAMDM
1998
95views more  SIAMDM 1998»
13 years 4 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
13 years 10 months ago
oddball: Spotting Anomalies in Weighted Graphs
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
Leman Akoglu, Mary McGlohon, Christos Faloutsos