Skip to search formSkip to main contentSkip to account menu

Graph realization problem

Known as: Graph realizability 
The graph realization problem is a decision problem in graph theory. Given a finite sequence of natural numbers, the problem asks whether there is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We study the asymptotic properties of a semi-definite programming (SDP) based localization algorithm in a network of wireless… 
2012
2012
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or… 
2012
2012
A multi-spacecraft system consists of wirelessly-connected spacecraft that share resources in Earth orbit or deep space. One of… 
2012
2012
In this paper, we study the asymptotic properties of a semidefinite programming (SDP) based localization algorithm in a network… 
2011
2011
It is often very useful to know the positions of the sensor nodes in a wireless sensor network. The semidefinite programming (SDP… 
2010
2010
  • Shiva Kintali
  • 2010
  • Corpus ID: 9000920
A celebrated theorem of Savitch [63] states that NSPACE( S) ⊆ DSPACE(S2). In particular, Savitch gave a deterministic algorithm… 
2008
2008
This paper studies the combinatorial properties of geometric structures, known as k-locally Delaunay graphs, introduced in the… 
2006
2006
Location is considered an important attribute in wireless sensor networks allowing the nodes to send locatio n stamped data. We… 
2002
2002
A prototype Haplotype Mapping strategy is presently being finalized by an NIH working group. The biological key to that strategy…