Sciweavers

871 search results - page 20 / 175
» The vertex-cover polynomial of a graph
Sort
View
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
14 years 11 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
DM
2002
104views more  DM 2002»
14 years 9 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...
Brigitte Servatius, Herman Servatius
DM
2002
96views more  DM 2002»
14 years 9 months ago
Chain polynomials and Tutte polynomials
The recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial. c 2002 Elsevier Science B.V. A...
Lorenzo Traldi
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
15 years 3 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
DM
2006
103views more  DM 2006»
14 years 9 months ago
Graph polynomials from principal pivoting
The recursive computation of the interlace polynomial introduced by Arratia, Bollob
Roland Glantz, Marcello Pelillo