1951 search results - page 38 / 391 » An algorithm for improving graph partitions |
WG
2004
Springer
15 years 3 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
ESA
2003
Springer
15 years 3 months ago
2003
Springer
A promising approach to graph clustering is based on the intuitive notion of intra-cluster density vs. inter-cluster sparsity. While both formalizations and algorithms focusing on ...
ICPR
2010
IEEE
14 years 8 months ago
2010
IEEE
In this paper, we propose a new algorithm for extending the hierarchical clustering methods and introduce a Multi-View Agglomerative Clustering approach to handle multi-view repre...
123
click to vote
MVA
2008
14 years 10 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
DAM
2008
14 years 10 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...