3396 search results - page 61 / 680 » Tree representations of graphs |
GC
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
OWLED
2007
13 years 10 months ago
2007
A new approach to spatioterminological reasoning is presented which is based on a hybrid knowledge representation system architecture and on a representation of the RCC family tree...
DAS
2006
Springer
14 years 15 days ago
2006
Springer
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We provide new tools, such as k-troikas and good subtreerepresentations, that allow us to give fast and simple algorithms computing branchwidth. We show that a graph G ha...
COMPGEOM
2011
ACM
13 years 12 days ago
2011
ACM
Abstract. We study the grid size that is needed to represent intersection graphs of convex polygons. Here the polygons are similar to a base polygon P whose corners have rational c...