5100 search results - page 159 / 1020 » The Linear Complexity of a Graph |
COLING
1996
13 years 11 months ago
1996
'Phis paper describes SemNet the internal Knowledge t{epresentation lbr LOLI'I'A I. LOMTA is a large scale Natural Language Engineering (NLE) system. As such the in...
IWPEC
2009
Springer
14 years 5 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
MFCS
2009
Springer
14 years 5 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
AVI
2004
13 years 11 months ago
2004
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...
JCT
2006
13 years 10 months ago
2006
We study the Bergman complex B(M) of a matroid M: a polyhedral complex which arises in algebraic geometry, but which we describe purely combinatorially. We prove that a natural su...