5889 search results - page 276 / 1178 » Graph Layout Problems |
192
click to vote
PODS
1993
ACM
15 years 10 months ago
1993
ACM
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
201
click to vote
FASE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
169
click to vote
DAGSTUHL
2007
15 years 8 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
157
click to vote
NIPS
2008
15 years 8 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
156
click to vote
FLAIRS
2006
15 years 8 months ago
2006
Decision support systems that capture, preserve, and reuse implicit knowledge can greatly benefit from explicitly using context. The development of this type of system can benefit...