Sciweavers

SIAMCO
2008
81views more  SIAMCO 2008»
13 years 11 months ago
Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
This paper presents new graph-theoretic results appropriate to the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, s...
Ming Cao, A. Stephen Morse, Brian D. O. Anderson
CIAC
2010
Springer
234views Algorithms» more  CIAC 2010»
14 years 3 months ago
Enumerating Rooted Graphs with Reflectional Block Structures
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
Bingbing Zhuang and Hiroshi Nagamochi