704 search results - page 71 / 141 » Isometrically Embedded Graphs |
111
Voted
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
122
Voted
ISAAC
2005
Springer
15 years 8 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
129
Voted
GD
1998
Springer
15 years 7 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
125
Voted
FOCS
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
128
Voted
SOFSEM
2007
Springer
15 years 8 months ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...