Sciweavers

265 search results - page 38 / 53
» The independence number in graphs of maximum degree three
Sort
View
CATS
2007
14 years 11 months ago
An Optimal Broadcasting Protocol for Mobile Video-on-Demand
The advance of wireless and mobile technology introduces a new type of Video-on-Demand (VOD) systems, namely the mobile VOD systems, that provide VOD services to mobile clients. I...
Regant Y. S. Hung, Hing-Fung Ting
GD
1997
Springer
15 years 1 months ago
Orthogonal 3-D Graph Drawing
This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volu...
Therese C. Biedl, Thomas C. Shermer, Sue Whiteside...
JCAM
2011
78views more  JCAM 2011»
14 years 17 days ago
Symmetric box-splines on root lattices
Root lattices are efficient sampling lattices for reconstructing isotropic signals in arbitrary dimensions, due to their highly symmetric structure. One root lattice, the Cartesia...
Minho Kim, Jörg Peters
DM
2002
86views more  DM 2002»
14 years 9 months ago
A chip-firing game and Dirichlet eigenvalues
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
Fan R. K. Chung, Robert B. Ellis
QSHINE
2005
IEEE
15 years 3 months ago
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
Zhenjiang Li, J. J. Garcia-Luna-Aceves