Kleitman–Wang algorithms
id:
kleitman-wang-algorithms-280-4350200
title:
Kleitman–Wang algorithms
text:
The Kleitman–Wang algorithms are two different algorithms in graph theory solving the digraph realization problem, i.e. the question if there exists for a finite list of nonnegative integer pairs a simple directed graph such that its degree sequence is exactly this list. For a positive answer the list of integer pairs is called digraphic. Both algorithms construct a special solution if one exists or prove that one cannot find a positive answer. These constructions are based on recursive algorith
brand slug:
wiki
category slug:
encyclopedia
description:
Graph theory algorithms
original url:
https://en.wikipedia.org/wiki/Kleitman%E2%80%93Wang_algorithms
date created:
date modified:
2023-03-12T11:56:37Z
main entity:
{"identifier":"Q18343454","url":"https://www.wikidata.org/entity/Q18343454"}
image:
fields total:
13
integrity:
14