C. Delorme  Home/Search
Context
Related
| ecp6.jussieu.fr/seminaire/p...011108.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ecp6.jussieu.fr/seminaire/papi... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We apply eigenvalue techniques for cut evaluation to produce relations between the weight and order of induced subgraphs, and apply these results to bound the stability number. (Update)
Active bibliography (related documents): More All
0.0: Some Applications of Laplace Eigenvalues of Graphs - Mohar (1997) (Correct)
0.0: Semidefinite Programming and Combinatorial Optimization - Goemans (Correct)
0.0: Approximation algorithms for semidefinite packing.. - Iyengar, Phillips, Stein (2004) (Correct)
Similar documents based on text: More All
0.1: A New Upper Bound for the Isoperimetric Number of deBruijn.. - Bültermann (1996) (Correct)
0.1: Constructive Quasi-Ramsey Numbers And Tournament Ranking - Czygrinow, Poljak, Rödl (1999) (Correct)
0.1: A Recipe for Semidefinite Relaxation for (0,1)-Quadratic.. - Poljak, Rendl, Wolkowicz (1992) (Correct)
BibTeX entry: (Update)
@misc{ delorme-eigenvalues,
author = "C. Delorme",
title = "Eigenvalues And Weights Of Induced Subgraphs",
url = "citeseer.ist.psu.edu/delorme99eigenvalues.html" }
Citations (may not include all citations):415 Improved approximation algorithms for maximum cut and satisf.. - Goemans, Williamson - 1995
111 Distance-regular graphs (context) - Brouwer, Cohen et al. - 1989
82 Lower bounds for the partitioning of graphs (context) - Donath, Hoffman - 1973
46 Laplacian eigenvalues and the maximum cut problem (context) - Delorme, Poljak - 1993
23 the Shannon capacity of a graph (context) - Lov'asz - 1979
Documents on the same site (http://www.ecp6.jussieu.fr/seminaire/papiers/0102/): More
Integer Polyhedra: Combinatorial Properties and Complexity - Sebö (2001) (Correct)
A Note on the Number of Matchings and Independent Sets.. - Fischermann.. (Correct)
Pavage des Polyominos et Bases de Gröbner - Bodini (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC