Sciweavers

136 search results - page 6 / 28
» About Duval's Conjecture
Sort
View
DAM
2008
101views more  DAM 2008»
13 years 7 months ago
Degree constrained subgraphs
In this paper, we present new structural results about the existence of a subgraph where the degrees of the vertices are pre-specified. Further, we use these results to prove a 16...
Louigi Addario-Berry, Ketan Dalal, Bruce A. Reed
JSYML
2006
69views more  JSYML 2006»
13 years 7 months ago
The proof-theoretic analysis of transfinitely iterated quasi least fixed points
The starting point of this article is an old question asked by Feferman in his paper on Hancock's conjecture [6] about the strength of ID
Dieter Probst
STOC
2009
ACM
171views Algorithms» more  STOC 2009»
14 years 8 months ago
On the geometry of graphs with a forbidden minor
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
James R. Lee, Anastasios Sidiropoulos
SIGCSE
2009
ACM
143views Education» more  SIGCSE 2009»
14 years 2 months ago
Thinking about computational thinking
Jeannette Wing’s call for teaching Computational Thinking (CT) as a formative skill on par with reading, writing, and arithmetic places computer science in the category of basic...
James J. Lu, George H. L. Fletcher
CORR
2010
Springer
117views Education» more  CORR 2010»
13 years 7 months ago
Reductions Between Expansion Problems
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
Prasad Raghavendra, David Steurer, Madhur Tulsiani