796 search results - page 77 / 160 » The Anonymous Subgraph Problem |
132
click to vote
JCO
2007
15 years 2 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
110
click to vote
GD
2004
Springer
15 years 8 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
151
click to vote
ALT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
134
click to vote
CASES
2004
ACM
15 years 6 months ago
2004
ACM
Extensible processors allow addition of application-specific custom instructions to the core instruction set architecture. However, it is computationally expensive to automaticall...
107
click to vote
ESA
2010
Springer
15 years 3 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...