Sciweavers

73 search results - page 5 / 15
» Labeling Schemes for Vertex Connectivity
Sort
View
IWDC
2005
Springer
156views Communications» more  IWDC 2005»
14 years 1 months ago
Labeling Schemes for Tree Representation
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
Reuven Cohen, Pierre Fraigniaud, David Ilcinkas, A...
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
14 years 19 days ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...
ICMCS
2006
IEEE
147views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Color Data Coding for Three-Dimensional Mesh Models Considering Connectivity and Geometry Information
In this paper, we propose a new predictive coding scheme for color data of three-dimensional (3-D) mesh models. We exploit connectivity and geometry information to improve coding ...
Young-Suk Yoon, Sung-Yeol Kim, Yo-Sung Ho
PCM
2005
Springer
123views Multimedia» more  PCM 2005»
14 years 1 months ago
Adaptive Vertex Chasing for the Lossless Geometry Coding of 3D Meshes
We present a new lossless geometry coding method for 3D triangle-quad meshes, Adaptive Vertex Chasing. Previous localized geometry coding methods have demonstrated better compressi...
Haeyoung Lee, Sujin Park
JCT
2008
65views more  JCT 2008»
13 years 7 months ago
Random graphs on surfaces
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
Colin McDiarmid