355 search results - page 25 / 71 » On Central Spanning Trees of a Graph |
DEXA
2010
Springer
14 years 10 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
169
click to vote
DISOPT
2011
14 years 4 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...
ICIP
2000
IEEE
15 years 11 months ago
2000
IEEE
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphreprese...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
109
click to vote
SAC
2011
ACM
14 years 20 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...