253 search results - page 18 / 51 » Perfection thickness of graphs |
DM
2010
13 years 3 months ago
2010
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...
WAOA
2010
Springer
13 years 6 months ago
2010
Springer
We study approximation solutions for the densest k-subgraph problem (DS-k) on several classes of intersection graphs. We adopt the concept of -quasi elimination orders, introduced ...
JGAA
2007
13 years 8 months ago
2007
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one c...
AISS
2010
13 years 5 months ago
2010
In this paper we proposed perfectly secure message transmission for reliable and secure communications in order to ensure that an adversary cannot obtain information (in the infor...
ALENEX
2009
13 years 9 months ago
2009
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...