1729 search results - page 238 / 346 » Bound Graph Polysemy |
150
Voted
ORL
2008
15 years 6 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
164
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
Let Qn be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one posit...
144
click to vote
APAL
2005
15 years 6 months ago
2005
Abstract. We prove that a finitely generated group is context-free whenever its Cayleygraph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Sc...
154
click to vote
TCS
2008
15 years 6 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
128
Voted
COMBINATORICA
2004
15 years 6 months ago
2004
We present a new method to show concentration of the upper tail of random variables that can be written as sums of variables with plenty of independence. We compare our method with...