34 search results - page 1 / 7 » Characterizing and Computing Minimal Cograph Completions |
FAW
2008
Springer
13 years 6 months ago
2008
Springer
STACS
2007
Springer
13 years 10 months ago
2007
Springer
TCS
2011
12 years 11 months ago
2011
Using a combinatorial characterization of digital convexity based on words, one defines the language of convex words. The complement of this language forms an ideal whose minimal...
MFCS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. A famous lower bound for the bilinear complexity of the multiplication in associative algebras is the Alder–Strassen bound. Algebras for which this bound is tight are c...
PVM
2004
Springer
13 years 10 months ago
2004
Springer
We consider a certain class of parallel program segments in which the order of messages sent affects the completion time. We give characterization of these parallel program segmen...