Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...
Abstract— In this paper, we study the accuracy of Cooperative Localization and Target Tracking (CLATT) in a team of mobile robots, and derive analytical upper bounds for the posi...
Faraz M. Mirzaei, Anastasios I. Mourikis, Stergios...
Given a graph we show how to construct a family of manifolds whose Euler characteristics are the values of the chromatic polynomial of the graph at various integers. The manifolds...
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...