47 search results - page 10 / 10 » A Lower Bound for Testing 3-Colorability in Bounded-Degree G... |
WAW
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Motivated by social network data mining problems such as link prediction and collaborative filtering, significant research effort has been devoted to computing topologica...
HM
2007
Springer
13 years 11 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...