1149 search results - page 33 / 230 » Minimally non-Pfaffian graphs |
ITCC
2003
IEEE
14 years 3 months ago
2003
IEEE
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
COMBINATORICA
2006
13 years 9 months ago
2006
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
JUCS
2006
13 years 9 months ago
2006
: This paper surveys some of the work that was inspired by Wagner's general technique to prove completeness in the levels of the boolean hierarchy over NP and some related res...
ICCV
2005
IEEE
14 years 11 months ago
2005
IEEE
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...