Sciweavers

686 search results - page 84 / 138
» Packing Cycles in Graphs
Sort
View
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
15 years 7 months ago
Increasingly correct message passing averaging algorithms
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Kurt Plarre, Francesco Bullo
113
Voted
GD
2003
Springer
15 years 5 months ago
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
STRINGOLOGY
2008
15 years 2 months ago
The Road Coloring and Cerny Conjecture
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
Avraham Trahtman
CORR
2007
Springer
113views Education» more  CORR 2007»
15 years 18 days ago
The road coloring problem
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
A. N. Trahtman
145
Voted
COCOON
2010
Springer
14 years 11 months ago
On Sorting Permutations by Double-Cut-and-Joins
The problem of sorting permutations by double-cut-and-joins (SBD) arises when we perform the double-cut-and-join (DCJ) operations on pairs of unichromosomal genomes without the gen...
Xin Chen