Sciweavers

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

7

STOC
2007
ACM

favoriteEmaildiscussreport

82views Algorithms» more STOC 2007»

Interval completion with few edges

14 years 4 months ago

Interval completion with few edges

Download www.ii.uib.no

Pinar Heggernes, Christophe Paul, Jan Arne Telle,

Real-time Traffic

Algorithms | Interval Completion | STOC 2007 |

claim paper

Related Content

» Graph drawings with few slopes

» Minimal Interval Completions

» Reconstruction of complete interval tournaments

» Binary subtrees with few labeled paths

» Nonfinite Axiomatizability and Undecidability of Interval Temporal Logics with C D and T

» Polynomial Precise Interval Analysis Revisited

» Bar kVisibility Graphs Bounds on the Number of Edges Chromatic Number and Thickness

» Power Domination Problem in Graphs

» An Overview of Semantics for the Validation of Numerical Programs

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	STOC
Authors	Pinar Heggernes, Christophe Paul, Jan Arne Telle, Yngve Villanger

Comments (0)