Skip to search formSkip to main contentSkip to account menu

Havel–Hakimi algorithm

Known as: Havel-Hakimi Algorithm 
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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Degree (graph theory)Erdős–Gallai theoremGraph (discrete mathematics)Graph realization problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Correction to “Cyclic Orbit Codes”
We would like to thank Mahdieh Hakimi Poroch and Ali Asghar Talebi for pointing out two errors in <xref ref-type="other" rid… 
2016
2016
Optimisation of analytical methods for the detection of cannabinoids and nicotine in hair
Unlike conventional biological samples (blood and urine), hair samples have a much wider detection period and can provide a… 
2011
2011
The Power to Resist: A Study of Dissidence Movements in Eastern Europe
2009
2009
Narrating Trauma and Suffering: Towards Understanding Intersubjectively Constituted Memory
Erinnern ist ein komplexer und fehleranfalliger Prozess, dies teilweise auch, weil es sich nicht um einen ausschlieslich… 
2008
2008
Best Monotone Degree Bounds for Various Graph Parameters
  • 2008
  • Corpus ID: 39052384
We identify best monotone degree bounds for the chromatic number and independence number of a graph. These bounds are best in the… 
2004
2004
How did the nutrient concentrations change in northeastern German lowland rivers during the last four millennia? - a paleolimnological study of floodplain sediments
This study focuses on the feasibility of floodplain sediments and fluvial sediments in paleomeanders and ox-bows of two lowland… 
2000
2000
The Interregnum Controversies in World Politics 1989–1999: Mission Impossible? The IMF and the Failure of the Market Transition in Russia
1994
1994
Comments on "An O(n^2.5) Fault Identification Algorithm for Diagnosable Systems"
For original paper see A.T. Dahbura and G.M. Masson, "An O(n/sup 2.5/) fault identification algorithm for diagnosable systems… 
1989
1989
A minimum separation algorithm for river routing with bounded number of jogs
  • A. Mirzaian
  • IEEE International Conference on Computer-Aided…
  • 1989
  • Corpus ID: 45413385
The single-layer rectilinear river routing model with no restriction on the number of jogs per wire is considered. In particular… 
1986
1986
Technical Note - A Dominance Theorem for the Stochastic Queue Median Problem
In this note we prove a dominance property of the set of Hakimi medians for the Stochastic Queue Median SQM problem on a network… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)