95 search results - page 16 / 19 » Hamiltonian-Laceability of Star Graphs |
ICPR
2006
IEEE
16 years 23 days ago
2006
IEEE
This paper presents a general framework for agglomerative hierarchical clustering based on graphs. Specifying an inter-cluster similarity measure, a subgraph of the similarity gra...
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
ICDM
2008
IEEE
15 years 6 months ago
2008
IEEE
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
ESA
2006
Springer
15 years 3 months ago
2006
Springer
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
185
click to vote
SIGMOD
2009
ACM
15 years 12 months ago
2009
ACM
With the proliferation of the RDF data format, engines for RDF query processing are faced with very large graphs that contain hundreds of millions of RDF triples. This paper addre...