10392 search results - page 419 / 2079 » Introduction to Computer Science |
189
click to vote
DAM
2011
15 years 1 months ago
2011
In this paper we show that the problem to decide whether the hamiltonian index of a given graph is less or equal to a given constant is ∗ Research supported by grants No. 1M0545...
179
Voted
ITICSE
2000
ACM
15 years 11 months ago
2000
ACM
We are concerned about a view in undergraduate computer science education, especially in the early courses, that it’s okay to be math-phobic and still prepare oneself to become ...
173
click to vote
SODA
1992
ACM
15 years 8 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
217
click to vote
SPIN
2012
Springer
13 years 9 months ago
2012
Springer
Abstract. Craig interpolation is an active research topic and has become a powerful technique in verification. We present SMTInterpol, an interpolating SMT solver for the quanti...
220
click to vote
Lecture Notes
"This is a standard senior-level algorithms class required of every computer science undergraduate and graduate student at the University of Illinois."