2487 search results - page 201 / 498 » Partitions of Graphs into Trees |
261
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
144
click to vote
APWEB
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
127
click to vote
WEBDB
2004
Springer
15 years 9 months ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
156
click to vote
INFOVIS
1997
IEEE
15 years 8 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
128
click to vote
DAC
2001
ACM
16 years 4 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...