It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
In this work, we present an algorithm for simultaneous template generation and matching. The algorithm profiles the graph and iteratively contracts edges to create the templates. ...
Ryan Kastner, Seda Ogrenci Memik, Elaheh Bozorgzad...
In this paper, we present a regularization approach on discrete graph spaces for perceptual image segmentation via semisupervised learning. In this approach, first, a spectral cl...
Implicit information embedded in semantic web graphs, such as topography, clusters, and disconnected subgraphs is difficult to extract from text files. Visualizations of the graph...