Sciweavers

3396 search results - page 2 / 680
» Tree representations of graphs
Sort
View
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
13 years 10 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
EJC
2007
13 years 5 months ago
Tree representations of graphs
Nancy Eaton, Zoltán Füredi, Alexandr V...
COMBINATORICS
2006
118views more  COMBINATORICS 2006»
13 years 5 months ago
Noncrossing Trees and Noncrossing Graphs
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a...
William Y. C. Chen, Sherry H. F. Yan
JCT
2006
110views more  JCT 2006»
13 years 5 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
KDID
2003
119views Database» more  KDID 2003»
13 years 6 months ago
Generalized Version Space Trees
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
Ulrich Rückert, Stefan Kramer