785 search results - page 17 / 157 » Embedding a Forest in a Graph |
DM
2007
13 years 7 months ago
2007
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
TAMC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
CATS
2008
13 years 9 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...