Lesson plan

Graph realization problem

The graph realization problem is a decision problem in graph theory. Given a finite sequence (d_1,\dots,d_n) of natural numbers, the problem asks whether there is a labeled simple graph such that (d_1,\dots,d_n) is the degree sequence of this graph. In the context of localization, the graph realization problem may also refer to finding a set of positions (x_1,\dots,x_n) in some Euclidean space such that the squared distances between the positions, given by d^2_{ij} , match the edge weights w_{ij} for all edges in an incomplete, undirected, weighted graph.

Back to article

Article summary

The graph realization problem is a decision problem in graph theory. Given a finite sequence (d_1,\dots,d_n) of natural numbers, the problem asks whether there is a labeled simple graph such that (d_1,\dots,d_n) is the degree sequence of this graph. In the context of localization, the graph realization problem may also refer to finding a set of positions (x_1,\dots,x_n) in some Euclidean space such that the squared distances between the positions, given by d^2_{ij} , match the edge weights w_{ij} for all edges in an incomplete, undirected, weighted graph.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.