Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Havel%E2%80%93Hakimi_algorithm> ?p ?o }
Showing triples 1 to 12 of
12
with 100 triples per page.
- Havel%E2%80%93Hakimi_algorithm abstract "The Havel–Hakimi algorithm is an algorithm in graph theory solving the graph realization problem, i.e. the question if there exists for a finite list of nonnegative integers a simple graph such that its degree sequence is exactly this list. For a positive answer the list of integers is called graphic. The algorithm constructs a special solution if one exists or proves that one cannot find a positive answer. This construction is based on a recursive algorithm. The algorithm was published by Havel (1955), and later by Hakimi (1962).".
- Havel%E2%80%93Hakimi_algorithm wikiPageExternalLink 19050.
- Havel%E2%80%93Hakimi_algorithm wikiPageID "43304405".
- Havel%E2%80%93Hakimi_algorithm wikiPageRevisionID "622169620".
- Havel%E2%80%93Hakimi_algorithm subject Category:Algorithms.
- Havel%E2%80%93Hakimi_algorithm subject Category:Graph_theory.
- Havel%E2%80%93Hakimi_algorithm comment "The Havel–Hakimi algorithm is an algorithm in graph theory solving the graph realization problem, i.e. the question if there exists for a finite list of nonnegative integers a simple graph such that its degree sequence is exactly this list. For a positive answer the list of integers is called graphic. The algorithm constructs a special solution if one exists or proves that one cannot find a positive answer. This construction is based on a recursive algorithm.".
- Havel%E2%80%93Hakimi_algorithm label "Havel–Hakimi algorithm".
- Havel%E2%80%93Hakimi_algorithm label "Havel–Hakimi-algoritmus".
- Havel%E2%80%93Hakimi_algorithm sameAs m.011lhsk6.
- Havel%E2%80%93Hakimi_algorithm wasDerivedFrom Havel–Hakimi_algorithm?oldid=622169620.
- Havel%E2%80%93Hakimi_algorithm isPrimaryTopicOf Havel–Hakimi_algorithm.