Property testing in graph theory concerns the design of sublinear‐time algorithms that, given query access to a large graph, swiftly distinguish between the case where the graph satisfies a global ...
Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results