785 search results - page 30 / 157 » Embedding a Forest in a Graph |
CCCG
2009
13 years 9 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
SIAMDM
2010
13 years 2 months ago
2010
Abstract. The conjecture of Bollob
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
COCOON
2008
Springer
13 years 9 months ago
2008
Springer
Given a class of graphs, G, a graph G is a probe graph of G if its vertices can be partitioned into two sets, P (the probes) and N (the nonprobes), where N is an independent set, s...
CODES
2000
IEEE
14 years 7 days ago
2000
IEEE
This paper describes the functional specification and verification portions of El Greco, a system for high-level, heterogeneous functional specification, efficient compiled si...