Sciweavers

118 search results - page 10 / 24
» A Simple Proof of Miller-Yu Theorem
Sort
View
ENDM
2008
80views more  ENDM 2008»
14 years 11 months ago
Polytopal complexes: maps, chain complexes and... necklaces
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It...
Frédéric Meunier
CPM
2004
Springer
138views Combinatorics» more  CPM 2004»
15 years 5 months ago
Reversal Distance without Hurdles and Fortresses
Abstract. This paper presents an elementary proof of the HannenhalliPevzner theorem on the reversal distance of two signed permutations. It uses a single PQ-tree to encode the vari...
Anne Bergeron, Julia Mixtacki, Jens Stoye
JCT
2007
111views more  JCT 2007»
14 years 11 months ago
Removing even crossings
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 11 months ago
The Complexity of Proving the Discrete Jordan Curve Theorem
The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid gr...
Phuong Nguyen, Stephen Cook
AIMSA
1998
Springer
15 years 4 months ago
A Blackboard Architecture for Guiding Interactive Proofs
The acceptance and usability of current interactive theorem proving environments is, among other things, strongly influenced by the availability of an intelligent default suggestio...
Christoph Benzmüller, Volker Sorge