715 search results - page 36 / 143 » On graphs with subgraphs having large independence numbers |
ADC
2005
Springer
14 years 1 months ago
2005
Springer
We propose a path-based scheme for storage and retrieval of RDF data using a relational database. The Semantic Web is much anticipated as the nextgeneration web where high-level p...
DM
2007
13 years 7 months ago
2007
A set of paths joining a vertex y and a vertex set L is called (y, L)-fan if any two of the paths have only y in common, and its width is the number of paths forming it. In weight...
AMTA
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We present an approach to semantic interpretation of syntactically parsed Japanese sentences that works largely parser-independent. The approach relies on a standardized ...
ICML
2007
IEEE
14 years 8 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
COMBINATORICS
1998
13 years 7 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...