1163 search results - page 107 / 233 » Embedding into Bipartite Graphs |
133
click to vote
STACS
2009
Springer
15 years 10 months 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...
113
click to vote
GD
2007
Springer
15 years 10 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...
145
click to vote
CEAS
2006
Springer
15 years 7 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...
162
click to vote
ICML
2010
IEEE
15 years 5 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...
137
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...