Sciweavers

3396 search results - page 206 / 680
» Tree representations of graphs
Sort
View
SRDS
2005
IEEE
14 years 2 months ago
Distributed Construction of a Fault-Tolerant Network from a Tree
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
Michael K. Reiter, Asad Samar, Chenxi Wang
3DOR
2009
13 years 7 months ago
SkelTre - Fast Skeletonisation for Imperfect Point Cloud Data of Botanic Trees
Terrestrial laser scanners capture 3D geometry as a point cloud. This paper reports on a new algorithm aiming at the skeletonisation of a laser scanner point cloud, representing a...
Alexander Bucksch, Roderik C. Lindenbergh, Massimo...
CIAC
2010
Springer
376views Algorithms» more  CIAC 2010»
14 years 6 months ago
Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights
In this paper we consider a natural generalization of the well-known Max Leaf Spanning Tree problem. In the generalized Weighted Max Leaf problem we get as input an undirected co...
Bart Jansen
CAV
2011
Springer
216views Hardware» more  CAV 2011»
13 years 25 days ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song
DM
2008
91views more  DM 2008»
13 years 9 months ago
Lower bounds for the game colouring number of partial k-trees and planar graphs
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...
Jiaojiao Wu, Xuding Zhu