Search Results - "F.2.2 [Theory of Computation]: Nonnumerical Algorithms and Problems-Pattern matching"

Solving the traffic and flitter challenges with tulip by Simonetto, P., Koenig, P.-Y., Zaidi, F., Archambault, D., Gilbert, F., Trung-Tien Phan-Quang, Mathiaut, M., Lambert, A., Dubois, J., Sicre, R., Brulin, M., Vieux, R., Melancon, G.

“… Our findings suggest that employee 30 may be of interest. In the second part of the paper, we describe our system for finding subgraphs in the social network subject to degree constraints…”
Get full text