Spectral techniques in graph algorithms
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 206-215
- https://doi.org/10.1007/bfb0054322
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- An algorithm for 3-colorable graphsInformation Processing Letters, 1997
- Coloring Random and Semi-Random k-Colorable GraphsJournal of Algorithms, 1995
- Expected complexity of graph partitioning problemsDiscrete Applied Mathematics, 1995
- Approximating maximum independent sets by excluding subgraphsBIT Numerical Mathematics, 1992
- Finding good approximate vertex and edge partitions is NP-hardInformation Processing Letters, 1992
- Large Cliques Elude the Metropolis ProcessRandom Structures & Algorithms, 1992
- Partitioning of unstructured problems for parallel processingComputing Systems in Engineering, 1991
- The solution of some random NP-hard problems in polynomial expected timeJournal of Algorithms, 1989
- Almost all k-colorable graphs are easy to colorJournal of Algorithms, 1988
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979