Sciweavers

3680 search results - page 115 / 736
» cases 2010
Sort
View
DM
2010
108views more  DM 2010»
15 years 6 months ago
Internally 4-connected binary matroids with cyclically sequential orderings
We characterize all internally 4-connected binary matroids M with the property that the ground set of M can be ordered (e0, . . . , en-1) in such a way that {ei, . . . , ei+t} is 4...
Jeremy Aikin, Carolyn Chun, Rhiannon Hall, Dillon ...
DM
2010
66views more  DM 2010»
15 years 6 months ago
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
The Bermond-Thomassen conjecture states that, for any positive integer r, a digraph of minimum out-degree at least 2r -1 contains at least r vertex-disjoint directed cycles. Thoma...
Stéphane Bessy, Nicolas Lichiardopol, Jean-...
ENDM
2010
72views more  ENDM 2010»
15 years 6 months ago
Earliest Arrival Flows in Networks with Multiple Sinks
Earliest arrival flows model a central aspect of evacuation planning: In a dangerous situation, as many individuals as possible should be rescued at any point in time. Unfortunate...
Melanie Schmidt, Martin Skutella
ECCC
2006
93views more  ECCC 2006»
15 years 6 months ago
On the Deduction Theorem and Complete Disjoint NP-Pairs
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
Olaf Beyersdorff
DT
2007
65views more  DT 2007»
15 years 6 months ago
A Highly Scalable GALS Crossbar Using Token Ring Arbitration
- This paper presents a new low latency Crossbar design that can be used to interface systems working at different frequencies. For case of multiple input ports contending for same...
Tejpal Singh, Alexander Taubin