Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

112

Voted

FAW
2008
Springer

117views Algorithms» more FAW 2008»

Characterizing and Computing Minimal Cograph Completions

15 years 4 months ago

Characterizing and Computing Minimal Cograph Completions

Download www.ii.uib.no

Daniel Lokshtanov, Federico Mancini, Charis Papado

Real-time Traffic

Algorithms | FAW 2008 |

claim paper

Related Content

» Characterizing Minimal Interval Completions

» Minimal nonconvex words

» Semisimple Algebras of Almost Minimal Rank over the Reals

» A Message Ordering Problem in Parallel Programs

» Fitting a Set of Points by a Circle

» Power Efficient Broadcast Scheduling with Delay Deadlines

» On the Categorizing of Simply Separable Relations in Partial FourValued Logic

» Improved Bounds for Computing Kemeny Rankings

» Allocation and Scheduling for MPSoCs via Decomposition and NoGood Generation

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	FAW
Authors	Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos

Comments (0)