2314 search results - page 14 / 463 » Minimal Partitions of a Graph |
GFKL
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
SPDP
1991
IEEE
13 years 12 months ago
1991
IEEE
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
COMPUTING
1999
13 years 8 months ago
1999
In line image understandingaminimal lineproperty preserving(MLPP)graphoftheimagecompliments the structural information in geometric graph representations like the run graph. With ...
GD
2006
Springer
14 years 2 days ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
APVIS
2004
13 years 9 months ago
2004
Visualizing information whose underlying graph is directed acyclic is easier if the graph is Minimal Vertex Series Parallel (MVSP). We present method of transforming any directed ...