книги Компьютеры и Интернет Операционные системы и сети Сети

Approximation algorithm for Minimum Face Spanning Subgraph. A solution to Minimize Cost for the real time Distribution, Layout

Код 898177

Нет в продаже

Аннотация к книге "Approximation algorithm for Minimum Face Spanning Subgraph. A solution to Minimize Cost for the real time Distribution, Layout"

One of the newest problem in the ?eld of planar graphs is to ?nd a connected subgraph of a plane graph such that all the faces of that plane graph are covered. The faces of a plane graph are the maximal regions of the plane that contain no point used in the embedding. A face is said to be covered or spanned if at least one of the vertices of that face boundary is visited. We denote this type of subgraph as a face spanning subgraph. The minimum face spanning subgraph is the face spanning...

Оставить комментарий

Оцените книгу:

Издательство: Книга по требованию
Дата выхода: июль 2011
ISBN: 978-3-6392-1250-1
Объём: 52 страниц
Масса: 98 г
Размеры(высота, ширина, толщина), см: 23 x 16 x 1

Вместе с этой книгой покупают

Просмотренные товары