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.
2015
2015
Some transport and diffusion processes on networks and their graph realizability
2015
2015
Redundantly rigid topologies in decentralized multi-agent networks
In this paper, we consider the problem of decentralized evaluation of redundant rigidity of a multi-agent network topology… 
2013
2013
On a Relationship Between Graph Realizability and Distance Matrix Completion
We consider a certain subclass of Henneberg-type edge-weighted graphs which is related to protein structure, and discuss an… 
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… 
2011
2011
A note on the characterization of digraphic sequences
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… 
2010
2010
A note on Fiedler vectors interpreted as graph realizations
Review
2007
Review
2007
Approximation Algorithms for Geometric Intersection Graphs
In this paper we describe together with an overview about other results the main ideas of our polynomial time approximation… 
1997
1997
Cuts, matrix completions and graph rigidity
This paper brings together several topics arising in distinct areas: polyhedral combinatorics, in particular, cut and metric… 
1993
1993
Modified Realizability Toposes and Strong Normalization Proofs
This paper is motivated by the discovery that an appropriate quotient SN of the strongly normalising untyped λ*-terms (where * is… 
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)