785 search results - page 72 / 157 » Embedding a Forest in a Graph |
STOC
1999
ACM
14 years 2 months ago
1999
ACM
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
CCCG
2008
13 years 11 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...
IJCV
2006
13 years 10 months ago
2006
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
AGTIVE
2003
Springer
14 years 3 months ago
2003
Springer
OptimixJ is a graph rewrite tool that can be embedded easily into the standard software process. Applications and models can be developed in Java or UML and extended by graph rewri...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Graph matching is a classical problem in pattern recognition with many applications, particularly when the graphs are embedded in Euclidean spaces, as is often the case for comput...