Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

First Page		Document Content
Date: 2012-04-20 08:45:09 Graph theory Mathematics Discrete mathematics Graph Shortest path problem Tree Hamiltonian path Connectivity Directed graph Ear decomposition Cycle Distance		Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Download Document from Source Website File Size: 430,39 KB Share Document on Facebook

	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
	Unique Sink Orientations of Grids ? Bernd G¨artner1 , Walter D. Morris, Jr.2 , and Leo R¨ ust3 DocID: 1riIF - View Document
	Query Graphs with Cuts: Mathematical Foundations Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt, DocID: 1rhkc - View Document
	This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOITPAMI, IEEE T DocID: 1rfgs - View Document
	Aachen Department of Computer Science Technical Report Better termination proving through cooperation DocID: 1rezO - View Document