Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,294 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
12 relations
Adjacency matrix
Bipartite realization problem
Decision problem
Degree (graph theory)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Vertex-weighted realizations of graphs
A. Bar-Noy
,
D. Peleg
,
Dror Rawitz
Theoretical Computer Science
2020
Corpus ID: 210985297
2015
2015
Semi-definite programming-based localization algorithm in networks with inhomogeneous transmission medium
E. Nadimi
,
J. Herp
,
M. H. Ramezani
Research in Adaptive and Convergent Systems
2015
Corpus ID: 18855280
We study the asymptotic properties of a semi-definite programming (SDP) based localization algorithm in a network of wireless…
Expand
2012
2012
The Connection between the Number of Realizations for Degree Sequences and Majorization
A. Berger
arXiv.org
2012
Corpus ID: 279944
The \emph{graph realization problem} is to find for given nonnegative integers $a_1,\dots,a_n$ a simple graph (no loops or…
Expand
2012
2012
Feasibility checks and control laws for reconfigurations of spacecraft clusters
N. Moshtagh
,
Amir Ali Ahmadi
,
M. Mesbahi
American Control Conference
2012
Corpus ID: 5681835
A multi-spacecraft system consists of wirelessly-connected spacecraft that share resources in Earth orbit or deep space. One of…
Expand
2012
2012
Semidefinite programming-based localization algorithm in networks with inhomogeneous media
E. Nadimi
,
V. Blanes-Vidal
,
V. Tarokh
Research in Adaptive and Convergent Systems
2012
Corpus ID: 18339959
In this paper, we study the asymptotic properties of a semidefinite programming (SDP) based localization algorithm in a network…
Expand
2011
2011
A new localization algorithm for wireless sensor network
Man-tian Xiang
,
Lihong Li
,
Chengzhi Long
,
Liyuan Zhang
International Conference on Electrical and…
2011
Corpus ID: 23651995
It is often very useful to know the positions of the sensor nodes in a wireless sensor network. The semidefinite programming (SDP…
Expand
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…
Expand
2008
2008
Locally Delaunay Realizability of Regular Series-Parallel Graphs
L. Grilli
,
Seok-Hee Hong
,
A. Symvonis
,
Camille Wormser
International Conference on Computational…
2008
Corpus ID: 13758151
This paper studies the combinatorial properties of geometric structures, known as k-locally Delaunay graphs, introduced in the…
Expand
2006
2006
Event Driven Sensor Network Localization
S. Nawaz
,
S. Jha
,
M. Peters
2006
Corpus ID: 17266930
Location is considered an important attribute in wireless sensor networks allowing the nodes to send locatio n stamped data. We…
Expand
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…
Jeremy Abramson
,
Fred Chong
,
+18 authors
D. Gusfield
2002
Corpus ID: 13900174
A prototype Haplotype Mapping strategy is presently being finalized by an NIH working group. The biological key to that strategy…
Expand
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)
ACCEPT & CONTINUE