1986 search results - page 81 / 398 » Path Separability of Graphs |
COCOON
2007
Springer
14 years 3 months ago
2007
Springer
We introduce the concept of colored simultaneous geometric embeddings as a generalization of simultaneous graph embeddings with and without mapping. We show that there exists a uni...
GD
2007
Springer
14 years 3 months ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
GC
2011
Springer
13 years 3 months ago
2011
Springer
The Ramsey number r(H, Kn) is the smallest positive integer N such that every graph of order N contains either a copy of H or an independent set of size n. The Tur´an number ex(m,...
BROADNETS
2007
IEEE
14 years 3 months ago
2007
IEEE
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...