Sciweavers

1736 search results - page 135 / 348
» The rank-width of Directed Graphs
Sort
View
APWEB
2005
Springer
15 years 10 months ago
Labeling Scheme and Structural Joins for Graph-Structured XML Data
When XML documents are modeled as graphs, many challenging research issues arise. In particular, query processing for graphstructured XML data brings new challenges because traditi...
Hongzhi Wang, Wei Wang 0011, Xuemin Lin, Jianzhong...
SSD
1999
Springer
116views Database» more  SSD 1999»
15 years 8 months ago
Generalizing Graphs Using Amalgamation and Selection
This work is a contribution to the developing literature on multi-resolution data models. It considers operations for model-oriented generalization in the case where the underlying...
John G. Stell, Michael F. Worboys
MP
2010
99views more  MP 2010»
15 years 2 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
150
Voted
APVIS
2010
15 years 2 months ago
Interactive local clustering operations for high dimensional data in parallel coordinates
In this paper, we propose an approach of clustering data in parallel coordinates through interactive local operations. Different from many other methods in which clustering is glo...
Peihong Guo, He Xiao, Zuchao Wang, Xiaoru Yuan
CASES
2009
ACM
15 years 2 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis