Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany Abstract. We consider the multivariate interlace polynomial introduced by Courc

First Page		Document Content
Date: 2012-05-16 12:04:39 Graph theory Matroid theory Polynomials Tutte polynomial Adjacency matrix Treewidth Tree decomposition Ear decomposition Graph coloring Planar separator theorem		Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth Markus Bl¨aser and Christian Hoffmann Saarland University, Germany Abstract. We consider the multivariate interlace polynomial introduced by Courc Add to Reading List Source URL: www-cc.cs.uni-saarland.de Download Document from Source Website File Size: 221,96 KB Share Document on Facebook

	Sage Reference Manual: Matroid Theory Release 8.3 The Sage Development Team DocID: 1uyEs - View Document
	Characterizing Graphs of Small Carving-Width R´emy Belmonte1? , Pim van ’t Hof1? , Marcin Kami´ nski3 , 2?? 4? ? ? Dani¨el Paulusma , and Dimitrios M. Thilikos DocID: 1rq3s - View Document
	ANALYTIC ZARISKI STRUCTURES AND NON-ELEMENTARY CATEGORICITY BORIS ZILBER Abstract. We study analytic Zariski structures from the point of view of non-elementary model theory. We show how to associate an abstract elementa DocID: 1rpNY - View Document
	Bonn Workshop on Combinatorial Optimization Wednesday, November 5th, 2008 Chair: Minyi Yue 09.00 – 09.30 DocID: 1rla1 - View Document
	Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains Isabelle Stanton∗ Ali Pinar† UC Berkeley Sandia National Laboratories‡ DocID: 1rdvb - View Document