Sciweavers

2487 search results - page 181 / 498
» Partitions of Graphs into Trees
Sort
View
NETWORKS
2010
15 years 5 months ago
Fixed-parameter tractability results for full-degree spanning tree and its dual
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
Jiong Guo, Rolf Niedermeier, Sebastian Wernicke
INFOCOM
2008
IEEE
16 years 28 days ago
Multicast Tree Diameter for Dynamic Distributed Interactive Applications
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
Knut-Helge Vik, Pål Halvorsen, Carsten Griwo...
EDBT
2010
ACM
138views Database» more  EDBT 2010»
15 years 11 months ago
How to authenticate graphs without leaking
Secure data sharing in multi-party environments requires that both authenticity and confidentiality of the data be assured. Digital signature schemes are commonly employed for au...
Ashish Kundu, Elisa Bertino
SDM
2008
SIAM
256views Data Mining» more  SDM 2008»
15 years 8 months ago
Graph Mining with Variational Dirichlet Process Mixture Models
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
Koji Tsuda, Kenichi Kurihara
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
16 years 19 days ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer