Примеры использования Book embedding на Английском языке и их переводы на Русский язык
{-}
-
Official
-
Colloquial
Therefore, an optimal coloring is equivalent to an optimal book embedding.
Book embedding has also been frequently applied in the visualization of network data.
In this equivalence, the number of colors in the coloring corresponds to the number of pages in the book embedding.
Every finite graph has a book embedding onto a book with a large enough number of pages.
In this formulation of book thickness, the colors of the edges correspond to the pages of the book embedding.
As Kainen(1990) described, a book embedding may be used to describe the phases of a traffic signal at a controlled intersection.
Because of this stack behavior,a single bundle can handle a set of communications links that form the edges of a single page in a book embedding.
Such a drawing is not a book embedding by the usual definition, but has been called a topological book embedding.
That is, although these structures actually have a complicated three-dimensional shape, their connectivity(when a secondary structure exists) can be described by a more abstract structure,a one-page book embedding.
Pavan, Tewari& Vinodchandran(2012)used book embedding to study the computational complexity theory of the reachability problem in directed graphs.
Since circle graph coloring with four ormore colors is NP-hard, and since any circle graph can be formed in this way from some book embedding problem, it follows that optimal book embedding is also NP-hard.
A book embedding of G onto B is a book drawing that forms a graph embedding of G into B. That is, it is a book drawing of G on B that does not have any edge crossings.
The book thickness, pagenumber, orstack number of G is the minimum number of pages required for a book embedding of G. Another parameter that measures the quality of a book embedding, beyond its number of pages, is its pagewidth.
Every two-page book embedding is a special case of a planar embedding, because the union of two pages of a book is a space topologically equivalent to the whole plane.
If a graph is drawn without crossings using an arc diagram in which each edge is a single semicircle,then the drawing is a two-page book embedding, something that is only possible for the subhamiltonian graphs, a subset of the planar graphs.
One of the main motivations for studying book embedding cited by Chung, Leighton& Rosenberg(1987) involves an application in VLSI design, to the organization of fault-tolerant multiprocessors.
For a given subset of these edges, the subset represents a collection of paths that can all be traversed without interference from each other if andonly if the subset does not include any pair of edges that would cross if the two edges were placed in a single page of a book embedding.
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 having the same line as their boundary.
Haslinger& Stadler(1999) have proposed a so-called"bi-secondary structure" for certain RNA pseudoknots that takes the form of a two-page book embedding: the RNA sequence is again drawn along a line, but the basepairs are drawn as arcs both above and below this line.
One of the original motivations for studying book embeddings involved applications in VLSI design,in which the vertices of a book embedding represent components of a circuit and the wires represent connections between them.
As well as for straight-line graph drawing, universal point sets have been studied for other drawing styles; in many of these cases, universal point sets with exactly n points exist,based on a topological book embedding in which the vertices are placed along a line in the plane and the edges are drawn as curves that cross this line at most once.
This drawing style corresponds to a book embedding with either one page(if all semicircles are above the line) or two pages(if both sides of the line are used), and was originally introduced as a way of studying the crossing numbers of graphs.
As Chung et al. observe, a given permutation can be sorted by this system if and only if a certain graph, derived from the permutation,has a book embedding with the vertices in a certain fixed order along the spine and with a number of pages that is at most equal to the number of stacks.
Two-page book embedding has also been used to find simultaneous embeddings of graphs, in which two graphs are given on the same vertex set and one must find a placement for the vertices in which both graphs are drawn planarly with straight edges.
Thus, a book embedding of this graph describes a partition of the paths into non-interfering subsets, and the book thickness of this graph(with its fixed embedding on the spine) gives the minimum number of distinct phases needed for a signalling schedule that includes all possible traffic paths through the junction.
Author of the book"Embedded systems programming: from model to robot.
Fan Chung et al. studied the problem of embedding a graph into a book with the graph's vertices in a line along the spine of the book.
Web site operator,the company Book& Travel sro is not responsible for the graphics, pictures, photos embedded by any accommodation facilities.
As Atneosen already observed, if edges may instead pass from one page to another across the spine of the book, then every graph may be embedded into a three-page book.
Editorial independence Freedom of the press Military journalism, as defined by United States Department of Defense War correspondent Propagandakompanie, German article on military propaganda units during World War II Enemy Image,a documentary about The Pentagon's approach to news coverage of war Generation Kill, a book about the experiences of an embedded journalist Weapons of Mass Deception, a documentary by former network journalist.