Sciweavers

142 search results - page 15 / 29
» On orthogonal ray graphs
Sort
View
GD
1995
Springer
14 years 2 days ago
Graph Layout Adjustment Strategies
Abstract. When adjusting a graph layout, it is often desirable to preserve various properties of the original graph in the adjusted view. Pertinent properties may include straightn...
Margaret-Anne D. Storey, Hausi A. Müller
COMGEO
2004
ACM
13 years 8 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
JMLR
2010
99views more  JMLR 2010»
13 years 3 months ago
On Combining Graph-based Variance Reduction schemes
In this paper, we consider two variance reduction schemes that exploit the structure of the primal graph of the graphical model: Rao-Blackwellised w-cutset sampling and AND/OR sam...
Vibhav Gogate, Rina Dechter
JSAT
2010
130views more  JSAT 2010»
13 years 3 months ago
DepQBF: A Dependency-Aware QBF Solver
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quan...
Florian Lonsing, Armin Biere
SWAT
1990
Springer
75views Algorithms» more  SWAT 1990»
14 years 16 days ago
Finding the k Smallest Spanning Trees
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
David Eppstein