5634 search results - page 700 / 1127 » About Abstract Classes |
189
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
211
click to vote
DM
2000
15 years 6 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
283
click to vote
ICFP
2009
ACM
16 years 7 months ago
2009
ACM
Type abstraction and intensional type analysis are features seemingly at odds--type abstraction is intended to guarantee parametricity and representation independence, while type ...
341
click to vote
PLDI
2009
ACM
16 years 7 months ago
2009
ACM
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
209
click to vote
ICFEM
2009
Springer
16 years 1 months ago
2009
Springer
Internet protocols encapsulate a significant amount of state, making implementing the host software complex. In this paper, we define the Statecall Policy Language (SPL) which pr...