Sciweavers

1402 search results - page 2 / 281
» Sparse-Memory Graph Search
Sort
View
CIKM
2009
Springer
13 years 11 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ALGORITHMS
2010
114views more  ALGORITHMS 2010»
13 years 2 months ago
Graph Extremities Defined by Search Algorithms
: Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search a...
Anne Berry, Jean R. S. Blair, Jean Paul Bordat, Ge...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
13 years 9 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
PVLDB
2008
167views more  PVLDB 2008»
13 years 3 months ago
Keyword search on external memory data graphs
Keyword search on graph structured data has attracted a lot of attention in recent years. Graphs are a natural "lowest common denominator" representation which can combi...
Bhavana Bharat Dalvi, Meghana Kshirsagar, S. Sudar...
DAM
2011
12 years 12 months ago
A General Label Search to investigate classical graph search algorithms
Many graph search algorithms use a labeling of the vertices to compute an ordering of the vertices. We generalize this idea by devising a general vertex labeling algorithmic proce...
Richard Krueger, Geneviève Simonet, Anne Be...