Sciweavers

4865 search results - page 203 / 973
» The Complexity of Graph Connectivity
Sort
View
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 9 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
SIGIR
1998
ACM
15 years 8 months ago
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
This paper addresses the problem of topic distillation on the World Wide Web, namely, given a typical user query to find quality documents related to the query topic. Connectivity...
Krishna Bharat, Monika Rauch Henzinger
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 3 months ago
Removing Local Extrema from Imprecise Terrains
In this paper, we study imprecise terrains, that is, triangulated terrains with a vertical error interval in the vertices. We study the problem of removing as many local extrema (...
Chris Gray, Frank Kammer, Maarten Löffler, Ro...
GD
1998
Springer
15 years 8 months ago
A Framework for Drawing Planar Graphs with Curves and Polylines
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
Michael T. Goodrich, Christopher G. Wagner
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
15 years 3 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia