199 search results - page 34 / 40 » Connectivity of addable graph classes |
SODA
2007
ACM
13 years 9 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
WEBI
2009
Springer
14 years 2 months ago
2009
Springer
Understanding query reformulation patterns is a key step towards next generation web search engines: it can help improving users’ web-search experience by predicting their inten...
FUIN
2010
13 years 6 months ago
2010
From an empirical point of view, the hardness of quantified Boolean formulas (QBFs), can be characterized by the (in)ability of current state-of-the-art QBF solvers to decide abo...
SOCIALCOM
2010
13 years 5 months ago
2010
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
DISOPT
2011
13 years 2 months ago
2011
We study the parameterized complexity of a directed analog of the Full Degree Spanning Tree problem where, given a digraph D and a nonnegative integer k, the goal is to construct a...