Sciweavers

420 search results - page 14 / 84
» Search on High Degree Graphs
Sort
View
STACS
2004
Springer
14 years 23 days ago
Matching Algorithms Are Fast in Sparse Random Graphs
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
Holger Bast, Kurt Mehlhorn, Guido Schäfer, Hi...
SIGMOD
2007
ACM
232views Database» more  SIGMOD 2007»
14 years 7 months ago
BLINKS: ranked keyword searches on graphs
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
Haixun Wang, Hao He, Jun Yang 0001, Philip S. Yu
COR
2010
146views more  COR 2010»
13 years 7 months ago
A search space "cartography" for guiding graph coloring heuristics
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz
MICCAI
2010
Springer
13 years 5 months ago
Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...
ICML
2008
IEEE
14 years 8 months ago
Fast incremental proximity search in large graphs
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
Purnamrita Sarkar, Andrew W. Moore, Amit Prakash