3 search results - page 1 / 1 » Construction Sequences and Certifying 3-Connectedness |
92
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Given two 3-connected graphs G and H, a construction sequence constructs
G from H (e. g. from the K4) with three basic operations, called
the Barnette-Grünbaum operations. These...
87
Voted
CAGD
2008
15 years 23 days ago
2008
Following [KP07], we analyze surfaces arising as an infinite sequence of guided C2 surface rings. However, here we focus on constructions of too low a degree to be curvature conti...
225
Voted
POPL
2009
ACM
16 years 1 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...