Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs Bruno Codenotti∗ Ivan Gerace† - Circulant graph - Document - PDFSEARCH.IO

First Page	Meta Content
	Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs Bruno Codenotti∗ Ivan Gerace† Add to Reading List Document Date: 2002-05-18 04:46:14 Open Document File Size: 122,96 KB Share Result on Facebook City Milano / / Country Italia / / Currency pence / / / IndustryTerm related systems / exhaustive search / polynomial time algorithm / approximation algorithms / computing / / Organization imc / / Product Pentax K-x Digital Camera / / Technology polynomial time algorithm / approximation algorithms / / SocialTag Algebraic graph theory Graph coloring Circulant matrix Determinants Circulant graph Regular graph Adjacency matrix Neighbourhood Clique Graph theory

Hardness Results and Spectral Techniques for Combinatorial Problems on Circulant Graphs Bruno Codenotti∗ Ivan Gerace†Add to Reading List