<--- Back to Details
First PageDocument Content
Graph theory / Mathematics / Discrete mathematics / Graph / Shortest path problem / Tree / Hamiltonian path / Connectivity / Directed graph / Ear decomposition / Cycle / Distance
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

Similar Documents

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

Theory and Techniques for Synthesizing a Family of Graph Algorithms Srinivas Nedunuri William R. Cook

DocID: 1xVkB - View Document

PDF Document

DocID: 1xkJU - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vmTo - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1vhpu - View Document

Graph theory Po-Shen Loh June

Graph theory Po-Shen Loh June

DocID: 1v8nl - View Document