Sciweavers

Share
CORR
2010
Springer
101views Education» more  CORR 2010»
9 years 9 months ago
Universal Loop-Free Super-Stabilization
Abstract. We propose an univesal scheme to design loop-free and superstabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isom...
Lélia Blin, Maria Potop-Butucaru, Stephane ...
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
9 years 9 months ago
Trees and Matchings
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
Richard Kenyon, James Gary Propp, David Bruce Wils...
CORR
2004
Springer
75views Education» more  CORR 2004»
9 years 9 months ago
Locally connected spanning trees on graphs
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v V (G). The pur...
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
COMBINATORICA
2004
127views more  COMBINATORICA 2004»
9 years 9 months ago
On Infinite Cycles I
We extend the basic theory concerning the cycle space of a finite graph to infinite locally finite graphs, using as infinite cycles the homeomorphic images of the unit circle in t...
Reinhard Diestel, Daniela Kühn
JGT
2007
99views more  JGT 2007»
9 years 9 months ago
Backbone colorings for graphs: Tree and path backbones
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, G...
JCM
2006
95views more  JCM 2006»
9 years 9 months ago
A Learning-based Adaptive Routing Tree for Wireless Sensor Networks
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
Ying Zhang, Qingfeng Huang
COMBINATORICA
2008
112views more  COMBINATORICA 2008»
9 years 9 months ago
On the rigidity of molecular graphs
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
Bill Jackson, Tibor Jordán
APPML
2010
86views more  APPML 2010»
9 years 9 months ago
A note on single-linkage equivalence
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu
COLOGNETWENTE
2009
9 years 10 months ago
Colored Trees in Edge-Colored Graphs
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
A. Abouelaoualim, V. Borozan, Yannis Manoussakis, ...
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
9 years 11 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
books