712 search results - page 38 / 143 » On Spectral Graph Drawing |
125
click to vote
GD
2003
Springer
15 years 7 months ago
2003
Springer
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
121
Voted
DCG
2008
15 years 2 months ago
2008
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
110
click to vote
CCCG
2010
15 years 3 months ago
2010
d Abstract) Debajyoti Mondal , Rahnuma Islam Nishat , Md. Saidur Rahman , and Muhammad Jawaherul Alam
118
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
We propose a general framework for learning from labeled and unlabeled data on a directed graph in which the structure of the graph including the directionality of the edges is co...
137
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...