335 search results - page 14 / 67 » How to Use Spanning Trees to Navigate in Graphs |
170
click to vote
EDBT
2010
ACM
15 years 10 months ago
2010
ACM
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...
194
click to vote
WADS
2009
Springer
16 years 17 days ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
154
click to vote
IADIS
2003
15 years 7 months ago
2003
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...
171
click to vote
IPL
1998
15 years 5 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
141
click to vote
COCO
2007
Springer
16 years 5 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...