Sciweavers

2283 search results - page 3 / 457
» Bounds of Graph Characteristics
Sort
View
JCP
2008
171views more  JCP 2008»
13 years 6 months ago
Mining Frequent Subgraph by Incidence Matrix Normalization
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...
Jia Wu, Ling Chen
ICRA
2007
IEEE
140views Robotics» more  ICRA 2007»
14 years 16 days ago
On the Performance of Multi-robot Target Tracking
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...
EJC
2007
13 years 6 months ago
Euler characteristics and chromatic polynomials
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...
Michael Eastwood, Stephen Huggett
JAL
2002
99views more  JAL 2002»
13 years 5 months ago
Kayles and Nimbers
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...
Hans L. Bodlaender, Dieter Kratsch
SIAMMAX
2011
180views more  SIAMMAX 2011»
13 years 1 months ago
Computing Characteristic Polynomials from Eigenvalues
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...
Rizwana Rehman, Ilse C. F. Ipsen