38 search results - page 1 / 8 » Leaving the Span |
WAOA
2007
Springer
13 years 10 months ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pap...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
We discuss a simple sparse linear problem that is hard to learn with any algorithm that uses a linear combination of the training instances as its weight vector. The hardness holds...
ACMACE
2007
ACM
13 years 8 months ago
2007
ACM
This article describes the design of WikiTUI, a tangible user interface system that allows readers to manipulate multimedia information tied to page-level locations in common book...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...