684 search results - page 38 / 137 » On embedding well-separable graphs |
163
Voted
SODA
2010
ACM
16 years 2 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
153
click to vote
STACS
2009
Springer
16 years 2 days ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
123
click to vote
GD
2007
Springer
15 years 11 months ago
2007
Springer
We propose a layout algorithm for micro/macro graphs, i.e. relational structures with two levels of detail. While the micro-level graph is given, the macro-level graph is induced b...
161
click to vote
CEAS
2006
Springer
15 years 9 months ago
2006
Springer
We describe a framework for representing email as well as meeting information as a joint graph. In the graph, documents and meeting descriptions are connected via other nontextual...
179
click to vote
ICML
2010
IEEE
15 years 6 months ago
2010
IEEE
Existing approaches to analyzing the asymptotics of graph Laplacians typically assume a well-behaved kernel function with smoothness assumptions. We remove the smoothness assumpti...