13603 search results - page 21 / 2721 » On the Complexity of Computing Treelength |
137
Voted
TCS
2010
14 years 11 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
148
click to vote
ICGI
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
128
click to vote
DLT
2009
15 years 1 months ago
2009
We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal...
136
click to vote
JASSS
2002
15 years 3 months ago
2002
In a paper published in JASSS, Chris Goldspink discusses the methodological implications of complex systems approaches to the modeling of social systems. Like others before him Go...