3396 search results - page 208 / 680 » Tree representations of graphs |
LPAR
2004
Springer
14 years 2 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
IWPEC
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
GD
2005
Springer
14 years 2 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
PODS
2008
ACM
14 years 9 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
ICALP
2001
Springer
14 years 1 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...