About: Kleitman–Wang algorithms

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Kleitman–Wang algorithms Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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 algorithms. Kleitman and Wang gave these algorithms in 1973.

Attributes	Values
rdfs:label	Kleitman–Wang algorithms (en)
rdfs:comment	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 algorithms. Kleitman and Wang gave these algorithms in 1973. (en)
sameAs	Kleitman–Wang algorithms
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Reflist dbt:Short_description
Subject	Graph algorithms
gold:hypernym	Algorithms
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Kleitman–Wang_algorithms?oldid=1067657052&ns=0
Wikipage page ID	43237093 (xsd:integer)
page length (characters) of wiki page	4242 (xsd:nonNegativeInteger)
Wikipage revision ID	1067657052 (xsd:integer)
Link from a Wikipage to another Wikipage	Sequence Graph algorithms Digraph realization problem Directed graph List (abstract data type) Enumeration Graph theory Integer Fulkerson–Chen–Anstee theorem Lexicographic order Recursion (computer science)
has abstract	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 algorithms. Kleitman and Wang gave these algorithms in 1973. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Kleitman–Wang_algorithms
is Wikipage redirect of	Kleitman-Wang algorithm Kleitman-Wang algorithms Kleitman–Wang algorithm
is Link from a Wikipage to another Wikipage of	Digraph realization problem Directed graph Daniel Kleitman Fulkerson–Chen–Anstee theorem Kleitman-Wang algorithm Kleitman-Wang algorithms Kleitman–Wang algorithm
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Kleitman–Wang_algorithms

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software