554 search results - page 15 / 111 » Optimizing in Graphs with Expensive Computation of Edge Weig... |
ISBI
2009
IEEE
14 years 3 months ago
2009
IEEE
Biological images have the potential to reveal complex signatures that may not be amenable to morphological modeling in terms of shape, location, texture, and color. An effective ...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis in a graph G with m edges and n vertices. The edges of G have non-negative weights on them. The p...
GD
2006
Springer
14 years 15 days ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
ESA
2005
Springer
14 years 2 months ago
2005
Springer
We present fully dynamic algorithms for maintaining 3- and 5-spanners of undirected graphs under a sequence of update operations. For unweighted graphs we maintain a 3or 5-spanner...
DEXA
2010
Springer
13 years 9 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...