5 search results - page 1 / 1 » wg 1999 |
WG
1999
Springer
13 years 8 months ago
1999
Springer
WG
1999
Springer
13 years 8 months ago
1999
Springer
WG
1999
Springer
13 years 8 months ago
1999
Springer
Abstract. In random geometric graphs, vertices are randomly distributed on [0, 1]2 and pairs of vertices are connected by edges whenever they are sufficiently close together. Layou...
WG
1995
Springer
13 years 7 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
WG
1999
Springer
13 years 8 months ago
1999
Springer
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...