2137 search results - page 180 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
155
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
174
click to vote
PDPTA
2007
15 years 7 months ago
2007
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
176
Voted
GD
1999
Springer
15 years 10 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...
173
click to vote
JAL
2006
15 years 6 months ago
2006
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
177
click to vote
GBRPR
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...