Sciweavers

708 search results - page 7 / 142
» A study of graph spectra for comparing graphs and trees
Sort
View
IEICET
2011
13 years 3 months ago
Minimum Spanning Tree Problem with Label Selection
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
Akio Fujiyoshi, Masakazu Suzuki
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 8 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan
GCB
2009
Springer
139views Biometrics» more  GCB 2009»
14 years 12 days ago
Graph-Kernels for the Comparative Analysis of Protein Active Sites
Abstract: Graphs are often used to describe and analyze the geometry and physicochemical composition of biomolecular structures, such as chemical compounds and protein active sites...
Thomas Fober, Marco Mernberger, Ralph Moritz, Eyke...
ICML
2010
IEEE
13 years 9 months ago
Random Spanning Trees and the Prediction of Weighted Graphs
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
FCT
2009
Springer
14 years 3 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito