5100 search results - page 129 / 1020 » The Linear Complexity of a Graph |
SIAMSC
2008
13 years 9 months ago
2008
A novel multilevel algorithm is presented for implementing the widely used linear sampling method in inverse obstacle scattering problems. The new method is shown to possess asympt...
AIPS
2010
13 years 10 months ago
2010
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
WG
2007
Springer
14 years 3 months ago
2007
Springer
Kelly-width is a parameter of directed graphs recently proposed by Hunter and Kreutzer as a directed analogue of treewidth. We give several alternative characterizations of direct...
ICALP
2004
Springer
14 years 2 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
TIT
2008
13 years 9 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...