785 search results - page 22 / 157 » Embedding a Forest in a Graph |
GPCE
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In meta programming with concrete object syntax, object-level programs are composed from fragments written in concrete syntax. The use of small program fragments in such ...
GBRPR
2009
Springer
14 years 13 days ago
2009
Springer
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— Embedding of a graph metric in Euclidean space efficiently and accurately is an important problem in general with applications in topology aggregation, closest mirror selectio...
DASFAA
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract. Discovery of evolving regions in large graphs is an important issue because it is the basis of many applications such as spam websites detection in the Web, community lif...