73 search results - page 1 / 15 » Labeling Schemes for Vertex Connectivity |
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
CCCG
2003
13 years 6 months ago
2003
An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encod...
COCOA
2008
Springer
13 years 6 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
PCM
2005
Springer
2005
Springer
Photometry Data Coding for Three-Dimensional Mesh Models Using Connectivity and Geometry Information
13 years 10 months ago
In this paper, we propose new predictive coding schemes for photometry data of three-dimensional (3-D) mesh models as per-vertex binding. We exploit geometry and connectivity infor...