Book embedding

Known as: Blankenship-Oporowski conjecture, Blankenship–Oporowski conjecture, Book thickness 
In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings into a book, a collection of half-planes all… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1958-2017
010020019582017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We model a dependency graph as a book, a particular kind of topological space, for semantic dependency parsing. The spine of the… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Review
2015
Review
2015
1. Bark is a vital and very visible part of woody plants, yet only recently has bark characteristics started to be considered as… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2015
2015
In this work we investigate the complexity of some problems related to the Simultaneous Embedding with Fixed Edges (SEFE) of k… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We consider the problem of embedding entities and relationships of multirelational data in low-dimensional vector spaces. Our… (More)
  • table 1
  • table 3
  • table 4
  • table 5
  • figure 1
Is this relevant?
2012
2012
Endo [5] proved that every toroidal graph has a book embedding with at most seven pages. In this paper, we prove that every… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
A 2-page book embedding of a graph places the vertices linearly on a spine (a line segment) and the edges on two pages (two half… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
  • 2008
A new mechanism is proposed for exciting the magnetic state of a ferromagnet. Assuming ballistic conditions and using WKB wave… (More)
  • figure 1
  • figure 2
Is this relevant?
2006
2006
A topological book embedding of a graph is an embedding in a book that carries the vertices in the spine of the book and the… (More)
  • figure 1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This paper addresses the question: how should N n-dimensional subspaces of m-dimensional Euclidean space be arranged so that they… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A book embedding of a graph consists of an embedding of its nodes along the spine of a book (i.e., a linear ordering of the nodes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?