1347 search results - page 8 / 270 » On the Structure of the Minimum Time Function |
APPINF
2003
13 years 9 months ago
2003
In this paper we present optimum interval routing algorithms for message passing networks that have topological structure defined by k-caterpillars and maximal outer planar graph...
CATS
1998
13 years 9 months ago
1998
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
WADS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
CGF
2005
13 years 7 months ago
2005
Current surface-based methods for interactive freeform editing of high resolution 3D models are very powerful, but at the same time require a certain minimum tessellation or sampl...
ISQED
2003
IEEE
14 years 28 days ago
2003
IEEE
A structurally testable delay fault might become untestable in the functional mode of the circuit due to logic or timing constraints or both. Experimental data suggests that there...