549 search results - page 44 / 110 » The corner arc algorithm |
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
ESA
2007
Springer
15 years 5 months ago
2007
Springer
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...
71
Voted
SAC
2005
ACM
15 years 4 months ago
2005
ACM
As opposed to finite domain CSPs, arc consistency cannot be enforced, in general, on CSPs over the reals, including very simple instances. In contrast, a stronger property, the s...
MFCS
2004
Springer
15 years 4 months ago
2004
Springer
Let G = (V, E) be a (directed) graph with vertex set V and edge (arc) set E. Given a set P of (source-sink) pairs of vertices of G, an important problem that arises in the computat...
93
Voted
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
—A high performance adaptive robust control (ARC) algorithm is developed for a class of nonlinear system with unknown input backlash, parametric uncertainties and uncertain nonli...