Sciweavers

220 search results - page 31 / 44
» tcs 2008
Sort
View
TCS
2008
13 years 5 months ago
The computational complexity of the parallel knock-out problem
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
Hajo Broersma, Matthew Johnson 0002, Daniël P...
TCS
2008
13 years 5 months ago
Motif patterns in 2D
Motif patterns consisting of sequences of intermixed solid and don't care characters have been introduced and studied in connection with pattern discovery problems of computa...
Alberto Apostolico, Laxmi Parida, Simona E. Rombo
TCS
2008
13 years 5 months ago
Game chromatic index of graphs with given restrictions on degrees
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg...
TCS
2002
13 years 4 months ago
CASL: the Common Algebraic Specification Language
The Common Algebraic Specification Language Casl is an expressive language for the formal specification of functional requirements and modular design of software. It has been desi...
Egidio Astesiano, Michel Bidoit, Hélè...
TCS
2002
13 years 4 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella