Sciweavers

1434 search results - page 157 / 287
» Graph Searching with Advice
Sort
View
GD
2003
Springer
14 years 2 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
PODS
1999
ACM
160views Database» more  PODS 1999»
14 years 1 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
HT
1997
ACM
14 years 1 months ago
Collective Phenomena in Hypertext Networks
A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a co...
Valery M. Chelnokov, Victoria L. Zephyrova
SODA
2008
ACM
131views Algorithms» more  SODA 2008»
13 years 10 months ago
PageRank and the random surfer model
In recent years there has been considerable interest in analyzing random graph models for the Web. We consider two such models - the Random Surfer model, introduced by Blum et al....
Prasad Chebolu, Páll Melsted
AIPS
2000
13 years 10 months ago
Distance-Based Goal-Ordering Heuristics for Graphplan
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion...
Subbarao Kambhampati, Romeo Sanchez Nigenda