4378 search results - page 748 / 876 » On the Complexity of Ordered Colourings |
169
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
162
click to vote
SCS
2003
15 years 7 months ago
2003
The decomposition of complex systems into manageable parts is an essential principle when dealing with complex technical systems. However, many safety and reliability modelling te...
189
click to vote
SDM
2003
SIAM
15 years 7 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
194
click to vote
ISMB
1998
15 years 7 months ago
1998
Existing query interfaces for biological databases are either based on fixed forms or textual query languages. Users of a fixed form-based query interface are limited to performin...
297
click to vote
PROLAMAT
1998
15 years 7 months ago
1998
Advanced manufacturing environments nowadays involve a number of cooperating heterogeneous nodes, where each node supports a distinct activity, and their joint efforts and informa...