Sciweavers

470 search results - page 36 / 94
» Local properties of geometric graphs
Sort
View
SDM
2009
SIAM
123views Data Mining» more  SDM 2009»
15 years 9 months ago
Randomization Techniques for Graphs.
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
Gemma C. Garriga, Kai Puolamäki, Sami Hanhij&...
LATA
2009
Springer
15 years 6 months ago
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
Bruno Courcelle
ACRI
2010
Springer
14 years 8 months ago
Using Cellular Automata on a Graph to Model the Exchanges of Cash and Goods
This paper investigates the behaviors and the properties of a "Give and Take" cellular automaton on a graph. Using an economical metaphor, this model implements the excha...
Ranaivo Mahaleo Razakanirina, Bastien Chopard
TCOM
2010
109views more  TCOM 2010»
14 years 10 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
15 years 1 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...