Sciweavers

3757 search results - page 13 / 752
» The overlap number of a graph
Sort
View
CVPR
2008
IEEE
14 years 10 months ago
Skeletal graphs for efficient structure from motion
We address the problem of efficient structure from motion for large, unordered, highly redundant, and irregularly sampled photo collections, such as those found on Internet photo-...
Noah Snavely, Steven M. Seitz, Richard Szeliski
ARSCOM
2004
124views more  ARSCOM 2004»
13 years 8 months ago
The Domatic Number of Regular Graphs
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
Peter Dankelmann, Neil J. Calkin
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
14 years 5 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
ACSC
2005
IEEE
14 years 2 months ago
A Framework of Filtering, Clustering and Dynamic Layout Graphs for Visualization
Many classical graph visualization algorithms have already been developed over the past decades. However, these algorithms face difficulties in practice, such as the overlapping n...
Xiaodi Huang, Peter Eades, Wei Lai