This article is available for purchase or by subscription. See below.
Abstract
|
The graphical realization of a given degree sequence and given partition adjacency
matrix simultaneously, is a relevant problem in data driven modeling of networks.
Here we formulate common generalizations of this problem and the exact matching
problem, and solve them with an algebraic Monte-Carlo algorithm that runs in
polynomial time if the number of partition classes is bounded by a constant. We note,
that no deterministic polynomial time algorithm is known for any of these
problems.
|
PDF Access Denied
We have not been able to recognize your IP address
18.97.14.89
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.
You may also contact us at
contact@msp.org
or by using our
contact form.
Or, you may purchase this single article for
USD 40.00:
Keywords
perfect matching, exact matching, degree sequence,
bipartite graph, Hall's theorem, joint degree matrix,
partition adjacency matrix, Monte-Carlo algorithm,
computational complexity
|
Mathematical Subject Classification 2010
Primary: 05D15
Secondary: 05C82, 05D40, 68W20
|
Milestones
Received: 29 September 2019
Revised: 7 April 2021
Accepted: 7 June 2021
Published: 13 December 2021
|
|