Sciweavers

2430 search results - page 251 / 486
» Computing Tutte Polynomials
Sort
View
JCT
2008
84views more  JCT 2008»
15 years 4 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
DAM
2007
120views more  DAM 2007»
15 years 4 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot
JMLR
2006
124views more  JMLR 2006»
15 years 4 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
EOR
2007
88views more  EOR 2007»
15 years 4 months ago
The stochastic location model with risk pooling
In this paper, we present a stochastic version of the Location Model with Risk Pooling (LMRP) that optimizes location, inventory, and allocation decisions under random parameters ...
Lawrence V. Snyder, Mark S. Daskin, Chung-Piaw Teo
CORR
2010
Springer
83views Education» more  CORR 2010»
15 years 2 months ago
Multitriangulations, pseudotriangulations and primitive sorting networks
We study the set of all pseudoline arrangements with contact points which cover a given support. We define a notion of flip which transforms a pseudoline arrangement with contact...
Vincent Pilaud, Michel Pocchiola