Exploració per tema "Matchings"
Ara es mostren els items 1-2 de 2
-
Compatible spanning trees
(2014-07-01)
Article
Accés obertTwo plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree ... -
Online matching in regular bipartite graphs with randomized adversary
(Springer, 2018-08)
Capítol de llibre
Accés restringit per política de l'editorial