We give a graph theoretical characterization of answer sets of normal logic programs. We show that there is a one-to-one correspondence between answer sets and a special, non-stan...
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
We introduce Tukey and Tukey scagnostics and develop graphtheoretic methods for implementing their procedure on large datasets. CR Categories: H.5.2 [User Interfaces]: Graphical U...
Leland Wilkinson, Anushka Anand, Robert L. Grossma...
This paper presents a generic approach to mesh global optimization via node movement, based on a discrete graph-theoretic model. Mesh is considered as an electric system with lump...