378 search results - page 1 / 76 » How Many Ways Can One Draw a Graph |
GD
2003
Springer
13 years 10 months ago
2003
Springer
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
GD
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
CRYPTO
2005
Springer
13 years 10 months ago
2005
Springer
Secret-key agreement between two parties Alice and Bob, connected by an insecure channel, can be realized in an informationtheoretic sense if the parties share many independent pai...
CVPR
2011
IEEE
12 years 8 months ago
2011
IEEE
How many people should you ask if you are not sure about your way? We provide an answer to this question for Random Forest classification. The presented method is based on the st...