Have a personal or library account? Click to login
Sampling k-partite graphs with a given degree sequence Cover

Sampling k-partite graphs with a given degree sequence

Acta Universitatis Sapientiae, Informatica
Volume 10 (2018): Issue 2 (December 2018)
By: Koko K. Kayibi,  U. Samee,  Shariefuddin Pirzada and  Muhammad Ali Khan  
Open Access
|Dec 2018

Download Article

Download the full article as a PDF file.

DOI: https://doi.org/10.2478/ausi-2018-0010 | Journal eISSN: 2066-7760
Journal RSS Feed
Language: English
Page range: 183 - 217
Submitted on: Oct 22, 2018
|
Published on: Dec 31, 2018
Published by: Sapientia Hungarian University of Transylvania
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
Degree sequence,
contraction of a degree sequence,
degree sequence bipartition,
contraction of a graph,
deletion of a graph,
ecological occurrence matrix
Related subjects:
Computer sciences,
Computer sciences, other

© 2018 Koko K. Kayibi, U. Samee, Shariefuddin Pirzada, Muhammad Ali Khan, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Previous articleVolume 10 (2018): Issue 2 (December 2018)Next article