ISSN 1944-9488
Vol. 11, Issue 3, 2015May 03, 2015 EDT
Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications
Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications
Articles in Vol. 11, Issue 3, 2015
Vol. 11, Issue 3, 2015
- Lack of Hyperbolicity in Asymptotic Erdös–Renyi Sparse Random GraphsOnuttom NarayanGabriel H. TucciIraj Saniee
- Toward Optimal Community Detection: From Trees to General Weighted NetworksThang N. DinhMy T. Thai
- Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory ApplicationsJérôme Kunegis
- Finding Safe Strategies for Competitive Diffusion on TreesCeleste VautourJeannette Janssen
- Inequality and Network Formation GamesSamuel D. JohnsonRaissa M. D’Souza
- Asymptotic Degree Distribution of a Duplication–Deletion Random Graph ModelErik Thörnblad
Kunegis, Jérôme. 2015. “Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications.” Internet Mathematics 11 (3). https://doi.org/10.1080/15427951.2014.958250.