Sciweavers

2612 search results - page 224 / 523
» Switching Graphs and Their Complexity
Sort
View
SPAA
1993
ACM
15 years 10 months ago
Optimal Parallel Construction of Hamiltonian Cycles and Spanning Trees in Random Graphs
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
Philip D. MacKenzie, Quentin F. Stout
ENC
2004
IEEE
15 years 9 months ago
Graph-Based Point Relaxation for 3D Stippling
Point hierarchies are suitable for creating framecoherent animations of 3D models in non-photorealistic styles such as stippling, painterly and other artistic rendering. In this p...
Oscar Meruvia Pastor, Thomas Strotthote
CIKM
2008
Springer
15 years 7 months ago
Scaling up duplicate detection in graph data
Duplicate detection determines different representations of realworld objects in a database. Recent research has considered the use of relationships among object representations t...
Melanie Herschel, Felix Naumann
JCT
2007
133views more  JCT 2007»
15 years 5 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky
TSMC
2008
138views more  TSMC 2008»
15 years 5 months ago
Image Thresholding Using Graph Cuts
A novel thresholding algorithm is presented in this paper to improve image segmentation performance at a low computational cost. The proposed algorithm uses a normalized graphcut m...
Wenbing Tao, Hai Jin, Yimin Zhang, Liman Liu, Desh...