Titlebook: ;

監(jiān)禁

How to Sell a Graph: Guidelines for Graph Retailers,mially solvable, contrasting its APX-hardness for the case of unlimited availability of items. However, if the underlying graph is a grid, and edge multiplicities are one, we show that it is even NP-complete to approximate the maximum profit to within a factor . ..

消耗

Cryptic

熱心

https://doi.org/10.1007/978-4-431-68467-1We present a fixed-parameter algorithm which computes for a set . of . points in the plane in . time a minimum weight triangulation. The parameter . is the number of points in . that lie in the interior of the convex hull of . and ..

商品

https://doi.org/10.1007/978-1-4020-8245-0In this paper, we study a new problem of finding a convex drawing of graphs with a . boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an ., can be obtained in linear time.

喊叫

泰然自若

cajole

Convex Drawings of Graphs with Non-convex Boundary,In this paper, we study a new problem of finding a convex drawing of graphs with a . boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an ., can be obtained in linear time.

Offensive

Graph-Theoretic Concepts in Computer Science978-3-540-48382-3Series ISSN 0302-9743 Series E-ISSN 1611-3349

anarchist