Sciweavers

3396 search results - page 54 / 680
» Tree representations of graphs
Sort
View
WG
2005
Springer
14 years 2 months ago
Computation of Chromatic Polynomials Using Triangulations and Clique Trees
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
Pascal Berthomé, Sylvain Lebresne, Kim Nguy...
DATESO
2004
134views Database» more  DATESO 2004»
13 years 10 months ago
Designing Indexing Structure for Discovering Relationships in RDF Graphs
Discovering the complex relationships between entities is one way of benefitting from the Semantic Web. This paper discusses new approaches to implementing -operators into RDF quer...
Stanislav Barton
CAISE
2005
Springer
14 years 2 months ago
Querying Tree-Structured Data Using Dimension Graphs
Abstract. Tree structures provide a popular means to organize the information on the Web. Taxonomies of thematic categories, concept hierarchies, e-commerce product catalogs are ex...
Dimitri Theodoratos, Theodore Dalamagas
FCT
2003
Springer
14 years 2 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
CIKM
2005
Springer
14 years 2 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu