Sciweavers

620 search results - page 27 / 124
» The edge-flipping group of a graph
Sort
View
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 8 months ago
Restricted Walks in Regular Trees
Let T be the Cayley graph of a finitely generated free group F. Given two vertices in T consider all the walks of a given length between these vertices that at a certain time must...
Laura Ciobanu, Sasa Radomirovic
JCT
2008
85views more  JCT 2008»
13 years 8 months ago
Smith normal form and Laplacians
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...
Dino J. Lorenzini
LAWEB
2003
IEEE
14 years 2 months ago
Clustering the Chilean Web
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
Satu Virtanen
BMVC
2010
13 years 6 months ago
Graph-based Analysis of Textured Images for Hierarchical Segmentation
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
Raffaele Gaetano, Giuseppe Scarpa, Tamás Sz...
MST
2011
231views Hardware» more  MST 2011»
12 years 11 months ago
On the Complexity of Matroid Isomorphism Problem
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in Σ p 2. In the case of linear matroids, which are represented over pol...
B. V. Raghavendra Rao, Jayalal M. N. Sarma