A (p, 1)-total labelling of a graph G is an assignment of integers to V (G) E(G) such that: (i) any two adjacent vertices of G receive distinct integers, (ii) any two adjacent ed...
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
This paper presents Yagada, an algorithm to search labelled graphs for anomalies using both structural data and numeric attributes. Yagada is explained using several security-rela...
Michael Davis, Weiru Liu, Paul Miller, George Redp...
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...