Sciweavers

2612 search results - page 9 / 523
» Switching Graphs and Their Complexity
Sort
View
TROB
2008
128views more  TROB 2008»
13 years 9 months ago
Convergence-Preserving Switching for Topology-Dependent Decentralized Systems
Abstract-- Stability analysis of decentralized control mechanisms for networked, coordinating systems has generally focused on specific controller implementations, such as nearest ...
Brian Shucker, Todd D. Murphey, John K. Bennett
MFCS
2007
Springer
14 years 4 months ago
On the Complexity of Computing Treelength
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
Daniel Lokshtanov
EJC
1998
13 years 9 months ago
A Convexity Lemma and Expansion Procedures for Bipartite Graphs
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
Wilfried Imrich, Sandi Klavzar
INFOCOM
2011
IEEE
13 years 1 months ago
A real-time multicast routing scheme for multi-hop switched fieldbuses
—The rapid scaling up of Networked Control Systems (NCS) is forcing traditional single-hop shared medium industrial fieldbuses (a.k.a. fieldbuses) to evolve toward multi-hop sw...
Lixiong Chen, Xue Liu, Qixin Wang, Yufei Wang
WG
2001
Springer
14 years 2 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...