813 search results - page 32 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
ECML
2007
Springer
14 years 3 months ago
2007
Springer
The problem of learning metrics between structured data (strings, trees or graphs) has been the subject of various recent papers. With regard to the specific case of trees, some a...
CCGRID
2010
IEEE
13 years 10 months ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
CCCG
2008
13 years 10 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
GG
2008
Springer
13 years 10 months ago
2008
Springer
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
JPDC
2006
13 years 9 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...