Live briefing
Everything about Book embedding
Graph layout on multiple half-planes
In graph theory, a book embedding is a generalization of planar embedding of a graph to embeddings in a book, a collection of half-planes all having the same line as their boundary. Usually, the vertices of the graph are required to lie on this boundary line, called the spine, and the edges are required to stay within a single half-plane. The book thickness of a graph is the smallest possible number of half-planes for any book embedding of the graph. Book thickness is also called pagenumber, stacknumber or fixed outerthickness. Book embeddings have also been used to define several other graph invariants including the pagewidth and book crossing number. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Book embeddingA 5-minute orientation
- Skim a recent paper: A survey on book-embedding of planar graphsInfluential work since 2022
- Pick up a classic book: Embedded multiprocessorsThe most-reprinted book on the subject
- Read the landmark paper: Embedding knots and links in an open book I: Basic propertiesCited 94 times
- Go sideways: 1-planar graphA closely related topic
- Go sideways: Queue numberA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Embedding knots and links in an open book I: Basic properties
Embedding Mathematical Dialogue in Parent–Child Shared Book Reading: A Preliminary Investigation
Enhancing Preschoolers’ Executive Functions Through Embedding Cognitive Activities in Shared Book Reading
Advancements on SEFE and Partitioned Book Embedding problems
Embedding knots and links in an open book II. Bounds on arc index
Parameterized Algorithms for Book Embedding Problems
Effects of embedding decontextualized language during book-sharing delivered by fathers in Turkey
Hybrid Book Recommendation System Using Collaborative Filtering and Embedding Based Deep Learning
🆕 Influential since 2022
A survey on book-embedding of planar graphs
Remb: regularized embedding memory book to extend metric learning in fault diagnosis
Enhancing Library Digitalization: A Heterogeneous Network Embedding Approach for Personalized Book Recommendations
Optimizing Hybrid Book Recommendation Systems: A Comparative Analysis of Learning Rates and Embedding Dimensions
The matching book embedding under some graph operations
📚 Books worth reading
Embedded multiprocessorsSundararajan Sriram, Sundararajan Sriram · 2000
Selected Writings of Edgar Allan PoeEdgar Allan Poe, David Galloway · 1967
Memory architecture exploration for programmable embedded systemsPeter Grun, Nikil D. Dutt · 2002
System designAndreas Gerstlauer, Rainer Dömer · 2001
Architecture exploration for embedded processors with LISAAndreas Hoffmann, Heinrich Meyr · 2002
Embedded programming with the Microsoft .NET micro FrameworkThompson, Donald., Donald Thompson · 2007
Modeling, verification, and exploration of task-level concurrency in real-time embedded systemsFilip Thoen, Filip Thoen · 1999
Pervasive computing[name missing], Uwe Hansmann · 2002
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 1-planar graph In topological graph theory, a 1-planar graph is a graph that can be drawn in the Euclidean plane in such a way that each edge has at most one crossing…
- Queue number In the mathematical field of graph theory, the queue number of a graph is a graph invariant defined analogously to stack number (book thickness) using…
- Graph embedding In topological graph theory, an embedding (also spelled imbedding) of a graph G {\displaystyle G} on a surface Σ {\displaystyle \Sigma } is a representation…
- Simultaneous embedding Simultaneous embedding is a technique in graph drawing and information visualization for visualizing two or more different graphs on the same or overlapping…
- Topological graph In mathematics, a topological graph is a representation of a graph in the plane, where the vertices of the graph are represented by distinct points and…
- Arc diagram An arc diagram is a style of graph drawing, in which the vertices of a graph are placed along a line in the Euclidean plane and edges are drawn using semicircle…
- Planarity Planarity is a 2005 puzzle computer game by John Tantalo, based on a concept by Mary Radcliffe at Western Michigan University. The name comes from the…
- Area (graph drawing) In graph drawing, the area used by a drawing is a commonly used way of measuring its quality. For a drawing style in which the vertices are placed on the…