3268 search results - page 355 / 654 » The hub number of a graph |
137
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
187
click to vote
AAAI
2008
15 years 9 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
180
click to vote
ACL
2008
15 years 8 months ago
2008
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...
152
click to vote
ESANN
2007
15 years 8 months ago
2007
A recently proposed nonlinear extension of Granger causality is used to map the dynamics of a neural population onto a graph, whose community structure characterizes the collective...
216
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...