![Graph theory / Mathematics / Discrete mathematics / Graph / Shortest path problem / Tree / Hamiltonian path / Connectivity / Directed graph / Ear decomposition / Cycle / Distance Graph theory / Mathematics / Discrete mathematics / Graph / Shortest path problem / Tree / Hamiltonian path / Connectivity / Directed graph / Ear decomposition / Cycle / Distance](https://www.pdfsearch.io/img/74a3e7ab8b2ea105bdd42855c7abe74f.jpg) Date: 2012-04-20 08:45:09Graph 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-naAdd to Reading ListSource URL: pagesperso.lina.univ-nantes.frDownload Document from Source Website File Size: 430,39 KBShare Document on Facebook
|