An Efficient Algorithm to Generate All Labeled Graphs with a Given Graphical Degree Sequence

Research output: Contribution to book or proceedingConference articlepeer-review

Abstract

We present a simple and efficient algorithm that generates all labeled graphs with a given graphical degree sequence. The algorithm does not discard any isomorphic duplicates during the generation process. It works by constructing a conceptual search tree each of whose leaf nodes represents a labeled realization of the input sequence. Furthermore, a natural lexicographical ordering is imposed on the labels of the vertices of the constructed graphs so that a corresponding lexicographical ordering is induced on all labeled realizations of the input sequence and the algorithm generates all outputs in this ordering. The algorithm can also be easily parallelized.

Original languageEnglish
Title of host publicationComputational Science and Computational Intelligence - 11th International Conference, CSCI 2024, Proceedings
EditorsHamid R. Arabnia, Leonidas Deligiannidis, Farzan Shenavarmasouleh, Soheyla Amirian, Farid Ghareh Mohammadi
PublisherSpringer Science and Business Media Deutschland GmbH
Pages40-52
Number of pages13
ISBN (Print)9783031951299
DOIs
StatePublished - Aug 12 2025
Event11th International Conference on Computational Science and Computational Intelligence, CSCI 2024 - Las Vegas, United States
Duration: Dec 11 2024Dec 13 2024

Publication series

NameCommunications in Computer and Information Science
Volume2506 CCIS
ISSN (Print)1865-0929
ISSN (Electronic)1865-0937

Conference

Conference11th International Conference on Computational Science and Computational Intelligence, CSCI 2024
Country/TerritoryUnited States
CityLas Vegas
Period12/11/2412/13/24

Scopus Subject Areas

  • General Computer Science
  • General Mathematics

Keywords

  • combinatorial generation
  • graphical degree sequence
  • labeled graph
  • labeled realization

Fingerprint

Dive into the research topics of 'An Efficient Algorithm to Generate All Labeled Graphs with a Given Graphical Degree Sequence'. Together they form a unique fingerprint.

Cite this