14386 search results - page 204 / 2878 » The Chinese Generals Problem |
187
click to vote
DAM
2011
14 years 11 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
100
click to vote
ICCS
2004
Springer
15 years 9 months ago
2004
Springer
The paper presents a highly optimized implementation of a multifrontal solver for linear systems arising in the FEM simulation of multi-physics problems related to the behaviour of...
154
Voted
IPCO
1993
15 years 5 months ago
1993
Lower bounds on the bandwidth, the size of a vertex separator of general undirected graphs, and the largest common subgraph of two undirected (weighted) graphs are obtained. The b...
170
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
137
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...