2612 search results - page 285 / 523 » Switching Graphs and Their Complexity |
161
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are W[1]-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers,...
157
click to vote
SODA
2010
ACM
16 years 2 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
148
click to vote
ECRTS
2008
IEEE
15 years 11 months ago
2008
IEEE
Embedded services and applications that interact with the real world often, over time, need to run on different kinds of hardware (low-cost microcontrollers to powerful multicore ...
154
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
134
click to vote
STACS
2007
Springer
15 years 11 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...