241 search results - page 1 / 49 » On the algorithmic effectiveness of digraph decompositions a... |
DISOPT
2011
12 years 11 months ago
2011
TCS
2008
13 years 4 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 ...
COCO
2010
Springer
13 years 8 months ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
ISCAS
2005
IEEE
13 years 10 months ago
2005
IEEE
The H.264 adopts various block types and multiple reference frames for motion compensation. For transcoding a video sequence from the H.263 format to the H.264 format, it is benef...
ICSM
2002
IEEE
13 years 9 months ago
2002
IEEE
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the most popular functional size measurement methods. In this paper, we recall some we...