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

	Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1 DocID: 1xVY3 - View Document
	Lower and Upper bounds for Online Directed Graph Exploration Klaus-Tycho Förster ETH Zurich – Distributed Computing – www.disco.ethz.ch DocID: 1vj8s - View Document
	Conflict-Directed Graph Coverage Daniel Schwartz-Narbonne1 , Martin Sch¨af2 , Dejan Jovanovi´c2 , Philipp R¨ ummer3 , and Thomas Wies1 1 DocID: 1sVcM - View Document
	Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1 DocID: 1rmNc - 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