13603 search results - page 42 / 2721 » On the Complexity of Computing Treelength |
COLOGNETWENTE
2010
13 years 7 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
ACRI
2010
Springer
13 years 8 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
SAS
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
IWPEC
2010
Springer
13 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
NCA
2007
IEEE
13 years 8 months ago
2007
IEEE
One of the key success factors behind the human species is the ability to think, plan and pursue goals. Apart from wisdom and tacit knowledge, experience and awareness of the phys...