3268 search results - page 6 / 654 » The hub number of a graph |
GLOBECOM
2009
IEEE
14 years 1 months ago
2009
IEEE
A large number of network applications today allow several users to interact together using the many-to-many service mode. A many-to-many session consists of group of users (we ref...
GD
2005
Springer
14 years 3 months ago
2005
Springer
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 co...
GLOBECOM
2008
IEEE
13 years 10 months ago
2008
IEEE
In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. Th...
PR
2008
13 years 9 months ago
2008
The "bag-of-frames" approach (BOF) to audio pattern recognition models signals as the long-term statistical distribution of their local spectral features, a prototypical...
ALGORITHMICA
2011
13 years 4 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...