An improved algorithm for counting graphical degree sequences of given length

Research output: Contribution to book or proceedingConference articlepeer-review

1 Scopus citations

Abstract

We present an improved version of a previous efficient algorithm that computes the number D(n) of zero-free graphical degree sequences of length n. A main ingredient of the improvement lies in a more efficient way to compute the function P(N,k,l,s) of Barnes and Savage. We further show that the algorithm can be easily adapted to compute the D(i) values for all i≤ n in a single run. Theoretical analysis shows that the new algorithm to compute all D(i) values for i≤ n is a constant times faster than the previous algorithm to compute a single D(n) value. Experimental evaluations show that the constant of improvement is about 10. The techniques for the improved algorithm can be applied to compute other similar functions that count the number of graphical degree sequences of various classes of graphs of given order or size and that all involve the function P(N,k,l,s).

Original languageEnglish
Title of host publicationProceedings - 6th Annual Conference on Computational Science and Computational Intelligence, CSCI 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages451-456
Number of pages6
ISBN (Electronic)9781728155845
DOIs
StatePublished - Dec 2019
Event6th Annual International Conference on Computational Science and Computational Intelligence, CSCI 2019 - Las Vegas, United States
Duration: Dec 5 2019Dec 7 2019

Publication series

NameProceedings - 6th Annual Conference on Computational Science and Computational Intelligence, CSCI 2019

Conference

Conference6th Annual International Conference on Computational Science and Computational Intelligence, CSCI 2019
Country/TerritoryUnited States
CityLas Vegas
Period12/5/1912/7/19

Keywords

  • Counting
  • Graphical degree sequence
  • Graphical partition

Fingerprint

Dive into the research topics of 'An improved algorithm for counting graphical degree sequences of given length'. Together they form a unique fingerprint.

Cite this