Theoretical Computer Science

The Threshold Dominating Set problem is that of determining for a graph G = (V, E) whether there is a subset V ⊆ V of size k, such that for each vertex v ∈ V there are at leas...

Rodney G. Downey, Michael R. Fellows

claim paper

Read More »

29

click to vote

TCS
1998

92views Theoretical Computer Science» more TCS 1998»

Merit Factors and Morse Sequences

13 years 11 months ago

Download www.im.pwr.wroc.pl

Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...

T. Downarowicz, Y. Lacroix

claim paper

Read More »

18

click to vote

TCS
1998

62views Theoretical Computer Science» more TCS 1998»

The Quotient of an Abstract Interpretation

13 years 11 months ago

Download www.dsi.unive.it

Agostino Cortesi, Gilberto Filé, William H....

claim paper

Read More »

22

click to vote

TCS
1998

102views Theoretical Computer Science» more TCS 1998»

Counting Non-Isomorphic Chord Diagrams

13 years 11 months ago

Download www.labri.fr

Robert Cori, Michel Marcus

claim paper

Read More »

38

click to vote

TCS
1998

87views Theoretical Computer Science» more TCS 1998»

A Uniform Approach to Semi-Dynamic Problems on Digraphs

13 years 11 months ago

Download ing.univaq.it

In this paper we propose a uniform approach to deal with incremental problems on digraphs and with decremental problems on dags generalizing a technique used by La Poutr´e and va...

Serafino Cicerone, Daniele Frigioni, Umberto Nanni...

claim paper

Read More »

13

click to vote

TCS
1998

68views Theoretical Computer Science» more TCS 1998»

Open Maps, Behavioural Equivalences, and Congruences

13 years 11 months ago