1729 search results - page 286 / 346 » Bound Graph Polysemy |
156
click to vote
ECCC
2010
15 years 3 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
157
Voted
MOR
2010
15 years 3 months ago
2010
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
158
click to vote
TAMC
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
130
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
153
click to vote
COLT
2010
Springer
15 years 3 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...