







See by year  See by month  Jump to month  

László Székely (University of South Carolina): The Partition Adjacency Matrix realization problem 



Friday, 8. December 2017, 14:00  15:00


Abstract. The problem that we discuss is the following: Can we realize a given degree sequence, such that we also satisfy two further restrictions simultaneously: (i) some pairs are forbidden to use as an edge, and (ii) the vertex set is partitioned into classes, and the number of edges in the realization should give prescribed number of edges between (and within) partition classes. This problem is relevant for network science. The talk focuses on the bipartite version of this problem. 
Location : Bolyai Intézet, I. emelet, Riesz terem, Aradi Vértanúk tere 1., Szeged 
Back
JEvents v3.1.8 Stable
Copyright © 20062013