2125 search results - page 217 / 425 » On Graph Complexity |
127
click to vote
GCB
2009
Springer
15 years 7 months ago
2009
Springer
: Understanding complex biological systems requires data from manifold biological levels. Often this data is analysed in some meaningful context, for example, by integrating it int...
128
click to vote
ADBIS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the ...
104
click to vote
ASPDAC
1995
ACM
15 years 6 months ago
1995
ACM
--In this paper, a region definition and ordering assignment (RDAOA) algorithm on minimizing the number of switchboxes is proposed. The time complexity of the algorithm is proved t...
141
click to vote
SIAMCOMP
2010
14 years 10 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,...
140
click to vote
SODA
2010
ACM
16 years 18 days 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,...