388 search results - page 6 / 78 » An approximate algorithm for median graph computation using ... |
GD
2009
Springer
14 years 11 days ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
PCI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Graphs are useful data structures capable of efficiently representing a variety of technological and social networks. They are therefore utilized in simulation-based stud...
ADHOCNOW
2008
Springer
14 years 2 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
WAW
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. This paper describes a technique for reducing the querytime cost of HITS-like ranking algorithm. The basic idea is to compute for each node in the web graph a summary of ...
NIPS
2007
13 years 9 months ago
2007
We present a new local approximation algorithm for computing MAP and logpartition function for arbitrary exponential family distribution represented by a finite-valued pair-wise ...