4378 search results - page 32 / 876 » On the Complexity of Ordered Colourings |
TCS
2008
13 years 8 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
RTA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
CAV
1998
Springer
14 years 1 months ago
1998
Springer
We present a two-part approach for verifying out-of-order execution. First, the complexity of out-of-order issue and scheduling is handled by creating der abstraction of the out-of...
NN
2007
Springer
14 years 3 months ago
2007
Springer
The signature of neuronal assemblies is the higher-order correlation structure of the spiking activity of the participating neurons. Due to the rapid progress in recording technol...
GD
2004
Springer
14 years 2 months ago
2004
Springer
A k-stack layout (respectively, k-queue layout) of a graph consists of a total order of the vertices, and a partition of the edges into k sets of non-crossing (non-nested) edges wi...