Sciweavers

1221 search results - page 51 / 245
» Balanced graph partitioning
Sort
View
DAGM
2003
Springer
15 years 5 months ago
Hierarchy of Partitions with Dual Graph Contraction
Abstract. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. This function measures the difference ...
Yll Haxhimusa, Walter G. Kropatsch
WG
2004
Springer
15 years 5 months ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
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...
Sabine Cornelsen, Gabriele Di Stefano
CCCG
2010
15 years 1 months ago
Some properties of higher order delaunay and gabriel graphs
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...
Prosenjit Bose, Sébastien Collette, Ferran ...
DAM
2006
88views more  DAM 2006»
14 years 12 months ago
A characterization of triangle-free tolerance graphs
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
Arthur H. Busch
ICDE
2006
IEEE
164views Database» more  ICDE 2006»
16 years 1 months ago
A Partition-Based Approach to Graph Mining
Existing graph mining algorithms typically assume that databases are relatively static and can fit into the main memory. Mining of subgraphs in a dynamic environment is currently ...
Junmei Wang, Wynne Hsu, Mong-Li Lee, Chang Sheng