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)

Related topics

Related topics

12 relations
Adjacency matrixBipartite realization problemDecision problemDegree (graph theory)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Vertex-weighted realizations of graphs
2015
2015
Semi-definite programming-based localization algorithm in networks with inhomogeneous transmission medium
We study the asymptotic properties of a semi-definite programming (SDP) based localization algorithm in a network of wireless… 
2012
2012
The Connection between the Number of Realizations for Degree Sequences and Majorization
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
Feasibility checks and control laws for reconfigurations of spacecraft clusters
A multi-spacecraft system consists of wirelessly-connected spacecraft that share resources in Earth orbit or deep space. One of… 
2012
2012
Semidefinite programming-based localization algorithm in networks with inhomogeneous media
In this paper, we study the asymptotic properties of a semidefinite programming (SDP) based localization algorithm in a network… 
2011
2011
A new localization algorithm for wireless sensor network
It is often very useful to know the positions of the sensor nodes in a wireless sensor network. The semidefinite programming (SDP… 
2010
2010
Realizable Paths and the NL vs L Problem
  • Shiva Kintali
  • Electron. Colloquium Comput. Complex.
  • 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
Locally Delaunay Realizability of Regular Series-Parallel Graphs
This paper studies the combinatorial properties of geometric structures, known as k-locally Delaunay graphs, introduced in the… 
2006
2006
Event Driven Sensor Network Localization
Location is considered an important attribute in wireless sensor networks allowing the nodes to send locatio n stamped data. We… 
2002
2002
Proceedings of the 2002 Uc Davis Student Workshop on Computing Proceedings of the 2002 Uc Davis Student Workshop on Computing Program Committee: Faculty Advisor: Administrative Assistants: Mary Brown…
A prototype Haplotype Mapping strategy is presently being finalized by an NIH working group. The biological key to that strategy… 
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)