163 search results - page 23 / 33 » Unifying Two Graph Decompositions with Modular Decomposition |
DMTCS
2010
13 years 5 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
SWAT
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
A tree decomposition of the coordinates of a code is a mapping from the coordinate set to the set of vertices of a tree. A tree decomposition can be extended to a tree realization,...
MPC
2010
Springer
13 years 10 months ago
2010
Springer
ion of Object Graphs in Program Verification Yifeng Chen1 and J.W. Sanders2 1 HCST Key Lab at School of EECS, Peking University, China. 2 UNU-IIST, Macao. A set-theoretic formalism...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...