3396 search results - page 3 / 680 » Tree representations of graphs |
IWCIA
2004
Springer
13 years 11 months ago
2004
Springer
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
JAPLL
2006
13 years 6 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...
GECCO
2007
Springer
14 years 4 days ago
2007
Springer
The Blob Code is a bijective tree code that represents each tree on n labelled vertices as a string of n − 2 vertex labels. In recent years, several researchers have deployed th...
SPAA
2009
ACM
14 years 6 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
SWAT
1994
Springer
13 years 10 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...